C. Smallest Word

https://codeforces.com/problemset/problem/1043/C

IA has so many colorful magnets on her fridge! Exactly one letter is written on each magnet, ‘a’ or ‘b’. She loves to play with them, placing all magnets in a row. However, the girl is quickly bored and usually thinks how to make her entertainment more interesting.

Today, when IA looked at the fridge, she noticed that the word formed by magnets is really messy. “It would look much better when I’ll swap some of them!” — thought the girl — “but how to do it?”. After a while, she got an idea. IA will look at all prefixes with lengths from 11 to the length of the word and for each prefix she will either reverse this prefix or leave it as it is. She will consider the prefixes in the fixed order: from the shortest to the largest. She wants to get the lexicographically smallest possible word after she considers all prefixes. Can you help her, telling which prefixes should be chosen for reversing?

A string aa is lexicographically smaller than a string bb if and only if one of the following holds:

• aa is a prefix of bb, but a≠ba≠b;
• in the first position where aa and bb differ, the string aa has a letter that appears earlier in the alphabet than the corresponding letter in bb.

Input

The first and the only line contains a string ss (1≤|s|≤10001≤|s|≤1000), describing the initial string formed by magnets. The string ss consists only of characters ‘a’ and ‘b’.Output

Output exactly |s||s| integers. If IA should reverse the ii-th prefix (that is, the substring from 11 to ii), the ii-th integer should be equal to 11, and it should be equal to 00 otherwise.

If there are multiple possible sequences leading to the optimal answer, print any of them.ExamplesinputCopy

bbab

outputCopy

0 1 1 0

inputCopy

aaaaa

outputCopy

1 0 0 0 1

Note

In the first example, IA can reverse the second and the third prefix and get a string “abbb”. She cannot get better result, since it is also lexicographically smallest string obtainable by permuting characters of the initial string.

In the second example, she can reverse any subset of prefixes — all letters are ‘a’.

---

思路：

1. Prefix Flip (Hard Version) 有一个10串变成0000000/1111111的中间串的结论
2. 这题通过构造可以发现10串前缀反转可以变成000001111/111110000的结论

启示：01串往特殊性构造去思考

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e3+100;
typedef long long LL;
LL vis[maxn];
int main(void)
{
  string s;cin>>s;
  for(LL i=0;i<s.size()-1;i++)
  {
  	if(s[i]!=s[i+1]) vis[i]=1;
  }
  if(s[s.size()-1]=='a') vis[s.size()-1]=1;
  for(LL i=0;i<s.size();i++) cout<<vis[i]<<" ";
  cout<<endl;
return 0;
}