摘要： http://poj.org/problem?id=3628 读完题感觉就是一01背包，仔细想想确又没什么好的思路，感觉只能暴力水水...　看了下discuss里讨论的，写了第一个代码#include<cstdio>#include<cstring>usingnamespacestd;intheg[21];boolf[20000001];intmain(){intn,h,i,j;while(~scanf("%d%d",&n,&h)){intsum=0;intmin=200000000;for(i=0;i<n;i++){scanf 阅读全文

摘要： hdu 2222:#include<cstdio>#include<cstring>#definemm88888#definemn55#defineN26inttire[mm][N];intfail[mm],w[mm],Q[mm];intcg[128];intsize;chartmp[mn],s[1111111];voidbuild(char*word){inti=0,j;for(;*word;++word,i=tire[i][j])if(!tire[i][j=cg[*word]]){memset(tire[size],0,sizeof(tire[size]));w[t 阅读全文