紫书第三章训练 UVA 1588 Kickdown by 16 BobHuang

A research laboratory of a world-leading automobile company has received an order to create a special transmission mechanism, which allows for incredibly efficient kickdown -- an operation of switching to lower gear. After several months of research engineers found that the most efficient solution requires special gears with teeth and cavities placed non-uniformly. They calculated the optimal flanks of the gears. Now they want to perform some experiments to prove their findings.

The first phase of the experiment is done with planar toothed sections, not round-shaped gears. A section of length n consists of n units. The unit is either a cavity of height h or a tooth of height 2h . Two sections are required for the experiment: one to emulate master gear (with teeth at the bottom) and one for the driven gear (with teeth at the top).

There is a long stripe of width 3h in the laboratory and its length is enough for cutting two engaged sections together. The sections are irregular but they may still be put together if shifted along each other.

The stripe is made of an expensive alloy, so the engineers want to use as little of it as possible. You need to find the minimal length of the stripe which is enough for cutting both sections simultaneously.

Input 

The input file contains several test cases, each of them as described below.

There are two lines in the input, each contains a string to describe a section. The first line describes master section (teeth at the bottom) and the second line describes driven section (teeth at the top). Each character in a string represents one section unit -- 1 for a cavity and 2 for a tooth. The sections can not be flipped or rotated.

Each string is non-empty and its length does not exceed 100.

Output 

For each test case, write to the output a line containing a single integer number -- the minimal length of the stripe required to cut off given sections.

Sample Input 

2112112112 
2212112 
12121212 
21212121 
2211221122 
21212

Sample Output 

10 
8 
15

这种不就很像牙齿咬合，上下两个值不能超过3，拿字符串模拟啊，但是好像结束条件要考虑清楚，而且这是线段相交的感觉，既可能在左端，也可以在右端，两边都需要考虑
但其实也不就是复制改下两个字符串不就好了。但是中间会有些奇怪的问题，比如你匹配后剩下的长度，当然是选择最长的啦，这个当时迷了，调了好一会。

#include<bits/stdc++.h>
using namespace std;
int main(){
string s,c;
while(cin>>s>>c)
{int mi=s.length()+c.length();
    for(int i=0;s[i];i++){
        int f=1;
        for(int j=0;c[j];j++){
            if(s[i+j]==0)break;
            if(s[i+j]+c[j]>3+2*'0'){
                f=0;
                break;
        }}
        if(f){
           int t=i+max(c.length(),s.length()-i);
           if(t<mi)
            mi=t;
        }
        }
        for(int i=0;c[i];i++){
        int f=1;
        for(int j=0;s[j];j++){
            if(c[i+j]==0)break;
            if(c[i+j]+s[j]>3+2*'0'){
                f=0;
                break;
        }}
        if(f){
           int t=i+max(c.length()-i,s.length());
           if(t<mi)
            mi=t;
        }
        }
        cout<<mi<<endl;}
return 0;
}