Codeforces1137B - Camp Schedule（KMP中的next数组）

Problem
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp’s schedule. After some continuous discussion, they came up with a schedule s, which can be represented as a binary string, in which the i-th symbol is ‘1’ if students will write the contest in the i-th day and ‘0’ if they will have a day off.
At the last moment Gleb said that the camp will be the most productive if it runs with the schedule t (which can be described in the same format as schedule s). Since the number of days in the current may be different from number of days in schedule t, Gleb required that the camp’s schedule must be altered so that the number of occurrences of t in it as a substring is maximum possible. At the same time, the number of contest days and days off shouldn’t change, only their order may change.
Could you rearrange the schedule in the best possible way?

Input
The first line contains string s (1⩽|s|⩽5000001⩽|s|⩽500000), denoting the current project of the camp’s schedule.
The second line contains string t (1⩽|t|⩽5000001⩽|t|⩽500000), denoting the optimal schedule according to Gleb.
Strings s and t contain characters ‘0’ and ‘1’ only.

Output
In the only line print the schedule having the largest number of substrings equal to t. Printed schedule should consist of characters ‘0’ and ‘1’ only and the number of zeros should be equal to the number of zeros in s and the number of ones should be equal to the number of ones in s.
In case there multiple optimal schedules, print any of them.

Examples
Input
101101
110
Output
110110
Input
10010110
100011
Output
01100011
Input
10
11100
Output
01

Note
In the first example there are two occurrences, one starting from first position and one starting from fourth position.
In the second example there is only one occurrence, which starts from third position. Note, that the answer is not unique. For example, if we move the first day (which is a day off) to the last position, the number of occurrences of tt wouldn’t change.
In the third example it’s impossible to make even a single occurrence.

题意：
给出两个0-1字符串s和t，问如何重排s可以使得产生的新字符串中包括最多的连续子串t，输出重排结果。

解法：
该题显然是要对t进行研究。包含最多子串要求两个子串重叠部分最大，就是要求t的前缀和后缀相同的最大长度，这也就是KMP中的next数组所求的。利用next[lent]求出重复长度，记录s中的0和1的个数（记为len0、len1），在len0和len1不为零的情况下不断重复t中去掉重复后缀的部分，一方归零后不断输出另一方直至归零即可。

代码：

include<iostream>
#include<cstdio>
#include<algorithm>
#include<stdlib.h>
#include<cstring>
using namespace std;

int len=0,lens=0,lent=0,len1=0,len0=0;
int Next[500000+5];
char s[500000+5],t[500000+5];

void calc_next(){
    Next[1]=0;
    for(int i=2,j=0;i<=lent;i++){
        while(j>0&&t[i]!=t[j+1])j=Next[j];
        if(t[i]==t[j+1])j++;
        Next[i]=j;
    }
}

int main()
{
    scanf("%s%s",s+1,t+1);
    lens=strlen(s+1),lent=strlen(t+1);
    for(int i=1;i<=lens;i++){
        if(s[i]=='1')len1++;
        else len0++;
    }
    calc_next();
    len=lent-Next[lent];
    //printf("%d         ",len);
    while(len0!=0||len1!=0){
        for(int i=1;i<=len;i++){
            if(len0==0&&len1==0)break;
            if(t[i]=='1'&&len1){
                printf("1");len1--;
            }else if(t[i]=='0'&&len0){
                printf("0");len0--;
            }else{
                if(len1){printf("1");len1--;}
                else {printf("0");len0--;}
            }
        }
    }
    return 0;
}