mtxxxx的blog

#include #include #include using namespace std;const int N=1000005;long long eu[N],ans[N];void eular(){ int i,j; for(i=2;i<N;i++) if(!eu[i]) { for(j=i;j<N;j

poj 1743 给定一个字符串，求最长重复子串，且这两个子串不重叠二分答案，判断答案k是否可行时，把后缀数组分成若干组，每组中重复子串的长度都大于或等于k（即height大于等于k），如果本组中sa的最大最小值之差大于k就满足不重复，即这个k可行#include #include #include #include using namespace std;const int m

BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 38460 Accepted: 16404DescriptionYou have just moved from Waterloo to a big city. The people h

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 20929 Accepted: 8795DescriptionAn earthquake takes place in Southeast Asia. The ACM (

The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 42757 Accepted: 25834Description73 88 1 02 7 4 44 5 2 6 5(Figu

4 Values whose Sum is 0Time Limit: 15000MSMemory Limit: 228000KTotal Submissions: 18896Accepted: 5619Case Time Limit: 5000MSDescriptionThe SUM problem can

Packing Unit 4D CubesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 2281Accepted: 758DescriptionWe usually think that there are three geometri

Sliding WindowTime Limit: 12000MSMemory Limit: 65536KTotal Submissions: 50906Accepted: 14640Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 i

A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 85145Accepted: 26414Case Time Limit: 2000MSDescriptionYou have

SequenceTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 8625Accepted: 2846DescriptionGiven m sequences, each contains n non-negative integer. Now we

Bound FoundTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 2406Accepted: 744Special JudgeDescriptionSignals of most probably extra-terrestrial or

//1.广搜,参考网址：http://www.cnblogs.com/jackge/archive/2013/03/28/2986804.html 本来是想用数组实现队列的但是mle了///于是改着改着就和网上的一样了。。。#include #include #include #include #include #include #include using namespace st

#include #include #include using namespace std;const int maxn=200010;char ss[maxn];int sa[maxn],t[maxn],t2[maxn],c[maxn],n,s[maxn];int Rank[maxn],height[maxn];void get_sa(int m){ int i,*x