conquerheaven-优快云博客

#include #include #include #include using namespace std;struct Node{ int x , y; Node(int a = 0 , int b = 0){ x = a , y = b; }};bool operator<(Node a , Node b){ if(a.x

2014-10-12 14:54:28 4872

原创 uva 12589 Learning Vector

题意：给你N个向量，从这些

2014-10-12 10:58:03 613

原创 zoj 3814 Sawtooth Puzzle(搜索-bfs)

Sawtooth PuzzleTime Limit: 10 Seconds Memory Limit: 65536 KBRecently, you found an interesting game called Sawtooth Puzzle. This is a single-player game played on a grid with 3 x 3 cells.

2014-09-12 11:40:58 615

原创 hdu 4044 GeoDefense（DP-树形DP）

hdu 4044 GeoDefense（DP-树形DP）

2014-09-05 20:31:52 951

原创 hdu 4064 Carcassonne(DP-插头DP)

CarcassonneTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 807 Accepted Submission(s): 313Problem DescriptionCarcassonne is a

2014-09-03 21:07:43 808

原创 hdu 4288 Coder（树形结构-线段树）

hdu 4288 Coder（树形结构-线段树）

2014-09-03 19:41:53 761

原创 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 1194

原创 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 448

原创 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 599

原创 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 460

原创 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 608

原创 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 717

原创 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 436

原创 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 588

原创 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 476

原创 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 630

原创 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 595

原创 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 401

原创 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 597

原创 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 546

原创 11478 - Halum（差分约束）

11478 - Halum

2014-08-08 14:38:20 602

原创 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 513

原创 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 480

原创 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 850

原创 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 459

原创 uva 10290 - {Sum+=i++} to Reach N（数论-整数因子分解）

Problem H{sum+=i++} to Reach NInput: standard inputOutput: standard outputMemory Limit: 32 MB All the positive numbers can be expressed as a sum of one, two or more consecutive positive i

2014-07-31 20:06:10 538

原创 poj 2151 Check the difficulty of problems(概率DP)

DP-概率DP，一道简单题。

2014-07-21 23:13:16 637

原创 poj 2499 Binary Tree（水题）

Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5990 Accepted: 2774DescriptionBackground Binary trees are a common data structure in comput

2014-07-18 22:25:22 447

原创 hdu 4845 拯救大兵瑞恩(bfs)

拯救大兵瑞恩Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 51 Accepted Submission(s): 13Problem Description　　　1944年，特种兵麦克接到国防部的命令，要求立即赶赴太平洋上

2014-07-16 20:57:43 1527

原创 hdu 2222 Keywords Search（字符串匹配-AC自动机）

Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32732 Accepted Submission(s): 10616Problem DescriptionIn the m

2014-07-08 21:00:12 549

原创 hdu Lawrence(DP-单调性优化-斜率优化）

LawrenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2058 Accepted Submission(s): 893Problem DescriptionT. E. Lawrence was

2014-07-04 21:09:53 487

原创 poj 1160 Post Office(DP-简单DP）

Post OfficeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15380 Accepted: 8334DescriptionThere is a straight highway with villages alongside the highwa

2014-07-04 15:37:33 438

原创 poj 3709 K-Anonymous Sequence(DP-单调性优化-斜率优化)

#include #include using namespace std;#define ll long long intconst int maxn = 500010;ll dp[maxn] , sum[maxn] , A[maxn];int que[maxn] , head , tail;int n , k;void initial(){ for(int i =

2014-07-04 00:10:56 555

polya波利亚计数poj2154

空空如也