poj
文章平均质量分 87
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
poj 1195
二维树状数组:http://www.java3z.com/cwbwebhome/article/article1/1369.html?id=4804 #include #include #define maxn 1035int C[maxn][maxn];int S;int lowbit(int t){ return t&(-t);}int Sum(int原创 2015-08-10 11:30:02 · 535 阅读 · 0 评论 -
poj 2774
最长公共子串 #include #include #include #include #define maxn 100010 * 2using namespace std;int n, k;int rank[maxn];int tmp[maxn];int sa[maxn], lcp[maxn];string S,T;bool compara_sa原创 2015-08-10 13:32:42 · 324 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers
poj 3468 A Simple Problem with Integers 用两个数组数组题意:给出n个数,然后进行q次处理,Q a b表示求出区间【a, b】的和, C a b c表示把区间[a, b]里的数都加上c。刚开始更新[a, b]区间里的数时,用了一个循环对区间内的每个点都更新一次,超时了思路:假设frist[i]表示原来第i个数的值, change[原创 2015-07-17 21:36:10 · 390 阅读 · 0 评论 -
POJ 1088 滑雪
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 86432 Accepted: 32326DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等原创 2015-12-23 01:23:57 · 392 阅读 · 0 评论 -
POJ2831 Can We Build This One?(次小生成树)
Can We Build This One?Time Limit: 5000MSMemory Limit: 65536KTotal Submissions: 1412Accepted: 525Case Time Limit: 2000MSDescription原创 2016-03-21 22:34:19 · 543 阅读 · 0 评论 -
POJ1679 The Unique MST(次小生成树)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25894 Accepted: 9256DescriptionGiven a connected undirected graph, t原创 2016-03-21 11:07:01 · 488 阅读 · 0 评论 -
poj2192 Zipper(dp)
ZipperTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17961Accepted: 6391DescriptionGiven three strings, you are to determine w原创 2016-07-25 23:12:05 · 378 阅读 · 0 评论 -
POJ2914 Minimum Cut(最小割模板题)
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9122 Accepted: 3820Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi原创 2016-09-19 16:31:53 · 1306 阅读 · 0 评论 -
POJ1459 Power Network(网络流)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27409 Accepted: 14256DescriptionA power network consists of nodes (power stations, consumers原创 2016-10-15 10:05:58 · 443 阅读 · 0 评论