hrbust1758

链接：http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1758

题意：输入两个字符串S,T,长度小于100000，求出在S中包含T中的最小的那段，例如：
S = "ADOBECODEBANC"
T = "ABC"
答案是  "BANC".

#include<stdio.h>
#include<string.h>
const int M=10005;
const int N=100005;
char s1[N],s2[N];
int m1[M],m2[M];
int l1,l2;
int main(){
    int i,j;
    int L,R,len;
    int kind1,kind2;
    while(scanf("%s",s1)!=EOF){
        scanf("%s",s2);
        l1=strlen(s1);
        l2=strlen(s2);
        kind1=kind2=0;
        memset(m1,0,sizeof(m1));
        memset(m2,0,sizeof(m2));
        for(i=0;i<l2;i++){
            if(!m2[s2[i]]) kind2++;
            m2[s2[i]]++;
        }
        int flag=0;
        len=N;
        for(i=j=0;i<l1;i++){
            if(m2[s1[i]]){
                m1[s1[i]]++;
                if(m1[s1[i]]==m2[s1[i]]) kind1++;
                if(kind1==kind2) flag=1;
            }
            while(1){
                if(!m2[s1[j]] || (m2[s1[j]]&&m1[s1[j]]>m2[s1[j]])){
                    m1[s1[j]]--;j++;
                }else break;
            }
            if(flag)
            if(i-j+1<len || (i-j+1==len&&j<L)){
                L=j;R=i;len=i-j+1;
            }
        }
        if(!flag) printf("");
        else for(i=L;i<=R;i++) printf("%c",s1[i]);
        printf("\n");
    }
    return 0;
}