摘要： http://acm.hdu.edu.cn/showproblem.php?pid=3065View Code 1 //3065 2 #include <cstdio> 3 #include <cstring> 4 #include <cctype> 5 using namespace std; 6 7 const int N=50100,B=26; 8 int trie[N][B]; 9 int key[N],cnt[N],fail[N];10 int sz,id;11 int que[N];12 char vac[1010][60];13 char s[ 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1255面积并View Code 1 //1255 2 #include <cstdio> 3 #include <algorithm> 4 using namespace std; 5 6 const int N=1010*2; 7 struct segment 8 { 9 double x1,x2,h; 10 int v; 11 segment(){} 12 segment(double t1,double t2,double th,double tv)... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2852View Code 1 //2852 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 6 const int N=100010,maxn=100000; 7 int c[N]; 8 int lowbit(int x) 9 {10 return x&(-x);11 }12 int sum(int x)13 {14 int s=0;15 for(int i=x;i>0;i-=lowbit 阅读全文