mtxxxx的blog

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8877 Accepted Submission(s): 5139Problem DescriptionSuppose that we hav

如果字符串是给定的，不询问区间，按照论文里写的，由于每个子串一定是某个后缀的前缀，相当于就是求后缀之间不相同前缀的个数。每次新加进来一个后缀，就是加上(n-sa[i]+1)个新前缀，但是其中有height[i]个前面已经算过了，减掉即可。这题询问的是一个区间[l,r]，一开始的思路是，对于每一个sa[i]在l到r之间的后缀，按前面那种方法计算，同时注意考虑一下lcp的右边超过了r的情况，过了样

题目http://acm.hust.edu.cn/vjudge/contest/view.action?cid=119769#problem/D#include #include #include int grid[250][250];bool vis[250][250];int sum,r,c,flag;int mov[4][2]={{1,0},{-1,0},{0,1},{0,-

//在求形如C(n,k)%p这样的式子时，如果p值是一个可变的素数，//而且不是特别大，就可以使用Lucas定理#include #include #include #include using namespace std;long long pow_mod(long long a,long long i,long long p){ if(i==0)return 1%p

//题目网址 http://acm.hdu.edu.cn/showproblem.php?pid=5673//以下参考过网上代码 http://m.blog.youkuaiyun.com/article/details?id=51227707#include #include #include #include using namespace std;const int mod=1000000007

#include #include #include using namespace std;int main(){ int num[26],head,tail,T,k,n,cnt; long long ans;//wa一次。。 char str[1000001]; cin>>T; while(T--) { scanf("%

#include #include #include #include #include using namespace std;const int maxn=1002,INF=1000000000;//最大流模板struct Edge{ int from,to,cap,flow; Edge(int u,int v,int c,int f):from(u),to

Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2919 Accepted Submission(s): 1099Problem DescriptionInhabitants of the Wo

SquareTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11794 Accepted Submission(s): 3784Problem DescriptionGiven a set of sticks of

What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 18607 Accepted Submission(s): 6087Problem DescriptionIgn

敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66198 Accepted Submission(s): 27898Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍

hdu 2717Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10630 Accepted Submission(s): 3319Problem Description

//第一次学到这种算法，算法分析和代码实现参考了博客： http://blog.youkuaiyun.com/xingyeyongheng/article/details/9310555 很详细#include #include #include using namespace std;const int maxn=110005;char str[maxn],s[maxn*2];int p[max