Codeforces Round #724 (Div. 2)C. Diluc and Kaeya（思维）

题目

The tycoon of a winery empire in Mondstadt, unmatched in every
possible way. A thinker in the Knights of Favonius with an exotic
appearance.

This time, the brothers are dealing with a strange piece of wood
marked with their names. This plank of wood can be represented as a
string of 𝑛 characters. Each character is either a ‘D’ or a ‘K’. You
want to make some number of cuts (possibly 0) on this string,
partitioning it into several contiguous pieces, each with length at
least 1. Both brothers act with dignity, so they want to split the
wood as evenly as possible. They want to know the maximum number of
pieces you can split the wood into such that the ratios of the number
of occurrences of ‘D’ to the number of occurrences of ‘K’ in each
chunk are the same.

Kaeya, the curious thinker, is interested in the solution for multiple
scenarios. He wants to know the answer for every prefix of the given
string. Help him to solve this problem!

For a string we define a ratio as 𝑎:𝑏 where ‘D’ appears in it 𝑎
times, and ‘K’ appears 𝑏 times. Note that 𝑎 or 𝑏 can equal 0, but
not both. Ratios 𝑎:𝑏 and 𝑐:𝑑 are considered equal if and only if
𝑎⋅𝑑=𝑏⋅𝑐.

For example, for the string ‘DDD’ the ratio will be 3:0, for ‘DKD’ —
2:1, for ‘DKK’ — 1:2, and for ‘KKKKDD’ — 2:4. Note that the ratios of
the latter two strings are equal to each other, but they are not equal
to the ratios of the first two strings.

Input Each test contains multiple test cases. The first line contains
the number of test cases 𝑡 (1≤𝑡≤1000). Description of the test cases
follows.

The first line of each test case contains an integer 𝑛 (1≤𝑛≤5⋅105) —
the length of the wood.

The second line of each test case contains a string 𝑠 of length 𝑛.
Every character of 𝑠 will be either ‘D’ or ‘K’.

It is guaranteed that the sum of 𝑛 over all test cases does not
exceed 5⋅105.

Output For each test case, output 𝑛 space separated integers. The
𝑖-th of these numbers should equal the answer for the prefix
𝑠1,𝑠2,…,𝑠𝑖.

Example inputCopy 5 3 DDK 6 DDDDDD 4 DKDK 1 D 9 DKDKDDDDK outputCopy 1
2 1 1 2 3 4 5 6 1 1 1 2 1 1 1 1 2 1 2 1 1 3 Note For the first
test case, there is no way to partition ‘D’ or ‘DDK’ into more than
one block with equal ratios of numbers of ‘D’ and ‘K’, while you can
split ‘DD’ into ‘D’ and ‘D’.

For the second test case, you can split each prefix of length 𝑖 into
𝑖 blocks ‘D’.

题意

将字符串划分成D和K的比例相同的连续子串，求最大划分数

代码

#include<iostream>
#include<map>
using namespace std;


void solve()
{
    int n;
    cin>>n;
    string s;
    cin>>s;
    double d=0,k=0;
    map<double,int>  cnt;
    for(auto it:s)
    {
        if(it=='D')d++;
        else if(it=='K')k++;
        cnt[d/k]++;
        cout<<cnt[d/k]<<' ';
    }
    cout<<endl;
}


int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}