- 博客(22)
- 资源 (1)
- 收藏
- 关注
RSS订阅
原创 hdu 4267 A Simple Problem with Integers(树形结构-线段树)
hdu 4267 A Simple Problem with Integers(树形结构-线段树)
2014-08-29 23:41:22
1112
原创 hdu 4276 The Ghost Blows Light(DP-树形DP)
hdu 4276 The Ghost Blows Light(DP-树形DP)
2014-08-29 21:01:19
898
原创 uva 11255 Necklace
Problem C - NecklaceOnce upon a time, three girls - Winnie, Grace and Bonnie - owned a large number of pearls. However, each of them only had a single color of pearls. Winnie had white pearls, G
2014-08-25 20:46:52
1173
原创 hdu 4031 Attack(树形结构-线段树)
AttackTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1773 Accepted Submission(s): 517Problem DescriptionToday is the 10th An
2014-08-19 10:50:35
423
原创 poj 1185 炮兵阵地（DP-状态DP）
炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19226 Accepted: 7424Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能
2014-08-17 14:05:19
576
原创 hdu 4902 Nice boat（树形结构-线段树）
Nice boatTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1502 Accepted Submission(s): 670Problem DescriptionThere is an o
2014-08-17 13:48:14
441
原创 hdu 4289 Control(图论-最小割)
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1606 Accepted Submission(s): 705Problem Description You, the head of
2014-08-17 13:38:06
586
原创 poj 2762 Going from u to v or from v to u?(tarjan+拓扑排序)
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14488 Accepted: 3812DescriptionIn order to make their sons brave, Jiaji
2014-08-17 11:30:22
684
原创 tarjan模板
/////////////////////////////tarjan struct edge{ int u , v , next; edge(int a = 0 , int b = 0 , int c = 0){ u = a , v = b , next = c; } }tarjan_e[maxe]; int ta
2014-08-13 15:29:59
422
原创 hdu 4911 Inversion(数论+线段树）
InversionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1398 Accepted Submission(s): 570Problem Descriptionbobo has a sequ
2014-08-13 13:54:48
570
原创 poj 2723 Get Luffy Out（图论-2-sat）
Get Luffy OutTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7512 Accepted: 2855DescriptionRatish is a young man who always dreams of being a hero. One
2014-08-13 11:37:34
456
原创 hdu 2196 Computer（DP-树形DP）
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3152 Accepted Submission(s): 1598Problem DescriptionA school bought t
2014-08-13 11:31:21
605
原创 poj 3254 Corn Fields(DP-状态DP)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7546 Accepted: 4025DescriptionFarmer John has purchased a lush new rectangular pasture compos
2014-08-13 10:34:03
577
原创 hdu 1026 Ignatius and the Princess I(bfs)
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12048 Accepted Submission(s): 3798Special JudgeProblem
2014-08-13 10:20:20
381
原创 hdu 3480 Division（DP-DP优化）
DivisionTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 999999/400000 K (Java/Others)Total Submission(s): 2999 Accepted Submission(s): 1168Problem DescriptionLittle D is re
2014-08-12 21:07:18
577
原创 hdu 4026 Unlock the Cell Phone(DP-状态DP)
Unlock the Cell PhoneTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 632 Accepted Submission(s): 289Problem DescriptionModern
2014-08-12 10:32:57
527
原创 poj 2112 Optimal Milking（spfa+二分+最大流）
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 11975 Accepted: 4340Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <=
2014-08-06 14:09:44
487
原创 dinic 模板
#include #include #include #include #include #include using namespace std;#define INF 1000000000const int maxn = 3010;////////////////////////int d[maxn];bool vis[maxn];struct edge{ i
2014-08-06 09:54:36
465
原创 poj 2486 Apple Tree（DP-树形DP）
Apple TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7114 Accepted: 2366DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX t
2014-08-01 22:18:48
826
原创 11795 - Mega Man's Mission(DP-状态DP)
BMega Man’s MissionsInputStandard InputOutputStandard Output Mega Man is off to save the world again. His objective is to kill the Robots created by D
2014-08-01 17:33:56
441
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人