摘要：/* 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 阅读全文

摘要：#include <iostream>#include <stdio.h>#include <string>#include <string.h>#include <algorithm>#include <stdlib.h>#include <math.h>#include <queue>using namespace std;const int maxn = 205;const int inf = 0xfffffff;struct node{ int x,y; int step; int time 阅读全文

摘要：题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1586#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath>#include <algorithm>#include <string>#include <iostream>using namespace std ;const int maxn = 1005;const int inf = 0xffff 阅读全文