摘要： CODE：#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>#include<map>usingnamespacestd;#defineMAXN10000001map<string,int>Map;charsz1[MAXN],sz2[MAXN];voidKMP(intlen1,intlen2){inti=0,j=0;while(i<len1) 阅读全文

摘要： CODE：#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>usingnamespacestd;#defineMAXN1000001#defineINF0x3f3f3f3finta[MAXN],sum[MAXN*10];intn,m,tot;voidinit(){tot=0;memset(sum,0,sizeof(sum));memset(a,0,sizeof(a));} 阅读全文

摘要： 大意：给你一方程，让你求零点。思路：对函数求导，知道它是单调递减的。由于保留4位小数，可以通过二分枚举大于1e-9的方法求零点而不会无限循环。CODE：#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>usingnamespacestd;#defineeps1e-9doublep,q,r,s,t,u;doublef(doublex){returnp*exp(-x)+q*s 阅读全文

摘要： CODE：#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;#defineMAXN500001intmain(){intn;while(scanf("%d",&n)&&n){for(inti=0;i<n;i++){scanf("%d%d",&a[i],&b[i]);}sort(a,a+n),s 阅读全文

摘要： 技巧挺强的。CODE：#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;#defineMAXN51intcmp(stringa,stringb){if(a+b>b+a)return1;return0;}//string已经重载了<>=运算符stringstr[MAXN];intmain(){intn;while(scanf("%d",&am 阅读全文