09 2014 档案
后缀数组dc3算法模版（待补）
摘要：模版：const int maxn = 1000010;#define F(x) ((x)/3+((x)%3==1?0:tb))#define G(x) ((x)=0;i--) b[--wss[wv[i]]]=a[i]; return;}void dc3(int *r,int *sa,int ... 阅读全文
posted @ 2014-09-24 10:28 someblue 阅读(339) 评论(0) 推荐(0)
CodeForces 467D（267Div2-D）Fedor and Essay （排序+dfs）
摘要：D. Fedor and Essaytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter you had helped Fedor to ... 阅读全文
posted @ 2014-09-23 18:16 someblue 阅读(538) 评论(1) 推荐(0)
HDU 3572 Task Schedule (最大流)
摘要：C -Task ScheduleTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 3572DescriptionOur geometry princess XMM has... 阅读全文
posted @ 2014-09-23 14:04 someblue 阅读(267) 评论(0) 推荐(0)
Acdream手速赛7
摘要：蛋疼啊，本次只做出了一道题目。。。渣爆了。。。妈蛋，，卡题之夜。。比赛结果是1道题，比赛完哗啦哗啦出4道题。。A acdream1191 Dragon Maze题意： 给一个迷宫，给出入口坐标和出口坐标，要求从入口到出口的步数尽可能少，如果有多种方案，则要求获得的分数尽可能多，获得的分数为经过的方格... 阅读全文
posted @ 2014-09-19 01:21 someblue 阅读(436) 评论(0) 推荐(0)
hdu2732 Leapin' Lizards (网络流dinic)
摘要：D -Leapin' LizardsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionYour platoon of wandering lizards has entered a strange... 阅读全文
posted @ 2014-09-18 09:31 someblue 阅读(305) 评论(0) 推荐(0)
HDU 3549 Flow Problem （最大流ISAP）
摘要：Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8199Accepted Submission(s): 3814Proble... 阅读全文
posted @ 2014-09-11 19:09 someblue 阅读(337) 评论(0) 推荐(0)
HDU 1532 Drainage Ditches （网络流）
摘要：A -Drainage DitchesTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionEvery time it rains on Farmer John's fields, a pond fo... 阅读全文
posted @ 2014-09-11 17:10 someblue 阅读(161) 评论(0) 推荐(0)