https://blog.csdn.net/daniel_csdnzh-cnhttps://blog.csdn.net/https://blog.csdn.net/daniel_csdn/article/details/52752305https://blog.csdn.net/daniel_csdn/article/details/52752305daniel_csdnFri, 07 Oct 2016 22:28:41 +0800 #define vct point using namespace std;const double pi=atan2(0,-1); const double eps=1e-8; int sgn(double d){ if(fabs(d)https://blog.csdn.net/daniel_csdn/article/details/52084661https://blog.csdn.net/daniel_csdn/article/details/52084661daniel_csdnMon, 01 Aug 2016 12:33:37 +0800 #include #inc]]>https://blog.csdn.net/daniel_csdn/article/details/52080659https://blog.csdn.net/daniel_csdn/article/details/52080659daniel_csdnSun, 31 Jul 2016 20:43:25 +0800https://blog.csdn.net/daniel_csdn/article/details/52078668https://blog.csdn.net/daniel_csdn/article/details/52078668daniel_csdnSun, 31 Jul 2016 15:06:20 +0800https://blog.csdn.net/daniel_csdn/article/details/52074271https://blog.csdn.net/daniel_csdn/article/details/52074271daniel_csdnSat, 30 Jul 2016 18:32:52 +0800https://blog.csdn.net/daniel_csdn/article/details/52068132https://blog.csdn.net/daniel_csdn/article/details/52068132daniel_csdnFri, 29 Jul 2016 19:49:23 +0800 using namespace std; const int maxn=1000;vectornxt[maxn+5]; int vis[maxn+5];bool d]]>https://blog.csdn.net/daniel_csdn/article/details/52065399https://blog.csdn.net/daniel_csdn/article/details/52065399daniel_csdnFri, 29 Jul 2016 15:24:32 +0800https://blog.csdn.net/daniel_csdn/article/details/52058811https://blog.csdn.net/daniel_csdn/article/details/52058811daniel_csdnThu, 28 Jul 2016 20:34:05 +0800=son.size()（即模式串在主串中的这两个位置不重叠）， 则d[i]=d[i-1]+d[j]； 如果这个j不存在则d[i]=d[i-1]+1。#include using na]]>https://blog.csdn.net/daniel_csdn/article/details/52049196https://blog.csdn.net/daniel_csdn/article/details/52049196daniel_csdnWed, 27 Jul 2016 20:33:14 +0800 using namespace std; const int maxn=1000; const int maxm=1000;int lca[maxn+5][maxn+5]; vectornxt]]>https://blog.csdn.net/daniel_csdn/article/details/52039416https://blog.csdn.net/daniel_csdn/article/details/52039416daniel_csdnTue, 26 Jul 2016 20:39:38 +0800>sum[cur]; return; } int m=(l+r)/2; if(p<=m)update(cur*2,l,m); else update(cur*2+1]]>https://blog.csdn.net/daniel_csdn/article/details/52039140https://blog.csdn.net/daniel_csdn/article/details/52039140daniel_csdnTue, 26 Jul 2016 20:06:23 +0800https://blog.csdn.net/daniel_csdn/article/details/52038617https://blog.csdn.net/daniel_csdn/article/details/52038617daniel_csdnTue, 26 Jul 2016 19:03:55 +0800 using namespace std; const int maxn=1000;int a[maxn+5]; int c[maxn+5]; int n;int lowbit(int x){ return x&(-x); }void add(int x,int d){//将a[x]增加d,修改就往右 while(x<=n){]]>https://blog.csdn.net/daniel_csdn/article/details/52027206https://blog.csdn.net/daniel_csdn/article/details/52027206daniel_csdnMon, 25 Jul 2016 20:30:54 +0800 #inc]]>https://blog.csdn.net/daniel_csdn/article/details/52016764https://blog.csdn.net/daniel_csdn/article/details/52016764daniel_csdnSun, 24 Jul 2016 22:22:44 +0800https://blog.csdn.net/daniel_csdn/article/details/51996253https://blog.csdn.net/daniel_csdn/article/details/51996253daniel_csdnFri, 22 Jul 2016 16:34:02 +0800https://blog.csdn.net/daniel_csdn/article/details/51995977https://blog.csdn.net/daniel_csdn/article/details/51995977daniel_csdnFri, 22 Jul 2016 16:12:01 +0800https://blog.csdn.net/daniel_csdn/article/details/51995898https://blog.csdn.net/daniel_csdn/article/details/51995898daniel_csdnFri, 22 Jul 2016 16:05:34 +0800https://blog.csdn.net/daniel_csdn/article/details/51941071https://blog.csdn.net/daniel_csdn/article/details/51941071daniel_csdnMon, 18 Jul 2016 12:48:47 +0800 using namespace std; const int maxn=1000; const int INF=0x3f3f3f3f; char a[maxn+5]; char]]>https://blog.csdn.net/daniel_csdn/article/details/51891820https://blog.csdn.net/daniel_csdn/article/details/51891820daniel_csdnTue, 12 Jul 2016 19:25:29 +0800https://blog.csdn.net/daniel_csdn/article/details/51891807https://blog.csdn.net/daniel_csdn/article/details/51891807daniel_csdnTue, 12 Jul 2016 19:23:42 +0800