摘要：
/* s1[i]与s2[i]匹配，树状数组i位置更新1，否则更新0。*/#include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>using namespace std;const int maxn = 1000005;int c[maxn];char s1[maxn],s2[maxn];int min(int a,int b){ return a>b?b:a;}int lowbit(int x){ return x&(-x);}void upda 阅读全文
