摘要： ---------------const int maxn=4100;const int maxm=10000;int n,m;int a[4][maxn];int b[maxn*maxn];int main(){ while (~scanf("%d",&n)){ for (int i=0;i<n;i++){ for (int k=0;k<4;k++){ scanf("%d",&a[k][i]); } } for (int i=0;i<n;i++){ for... 阅读全文

摘要： ----------------int n,m;int w[maxn],b[maxn];int s1[maxn],s2[maxn];int w1,b1,w2,b2;double ans,mo;bool flag;void work(int x,int y) { w1=w1-w[s1[x]]+w[s2[y]]; w2=w2-w[s2[y]]+w[s1[x]]; b1=b1-b[s1[x]]+b[s2[y]]; b2=b2-b[s2[y]]+b[s1[x]]; swap(s1[x],s2[y]);}void cal() { if (w1>b1&&w2>b2) {... 阅读全文

摘要： POJ 3882 TLE 需后缀数组------------const int SEED = 13331;const int MAX_N = 50000 + 10;char s[MAX_N];struct HASH{ ULL H[MAX_N]; ULL XL[MAX_N]; int len; HASH(){} void build(char *s){ len=strlen(s); H[len]=0; XL[0]=1; for (int i=len-1;i>=0;i--){ H[i]=H[... 阅读全文