08 2015 档案

POJ22230 Watchcow (欧拉回路)
摘要：WatchcowTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 6477Accepted: 2823Special JudgeDescriptionBessie's been appointed the new watch-cow f... 阅读全文
posted @ 2015-08-26 09:41 JoneZP 阅读(175) 评论(0) 推荐(0)
中国剩余定理
摘要：转：ACM 进阶学习第一课----同余相关之中国剩余定理：m.blog.csdn.net/blog/hu1020935219/14112149 数论——中国剩余定理(互质与非互质)：http://yzmduncan.iteye.com/blog/1323599/ hdu 3579 Hello Ki... 阅读全文
posted @ 2015-08-24 21:27 JoneZP 阅读(226) 评论(0) 推荐(0)
HDU3994(Folyd + 期望概率）
摘要：Mission ImpossibleTime Limit: 30000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 227Accepted Submission(s): 106... 阅读全文
posted @ 2015-08-19 22:39 JoneZP 阅读(324) 评论(0) 推荐(0)
POJ1270 Following Orders （拓扑排序）
摘要：Following OrdersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4254Accepted: 1709DescriptionOrder is an important concept in mathematics and... 阅读全文
posted @ 2015-08-17 15:55 JoneZP 阅读(210) 评论(0) 推荐(0)
HDU 3634 City Planning (离散化)
摘要：City PlanningTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 483Accepted Submission(s): 203Problem... 阅读全文
posted @ 2015-08-16 15:13 JoneZP 阅读(288) 评论(0) 推荐(0)
HDU4762（JAVA大数)
摘要：Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1102Accepted Submission(s): 540Problem... 阅读全文
posted @ 2015-08-16 14:54 JoneZP 阅读(200) 评论(0) 推荐(0)
POJ3026（BFS + prim)
摘要：Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:10554Accepted:3501DescriptionThe Borg is an immensely powerful race of enhanced humanoi... 阅读全文
posted @ 2015-08-16 14:44 JoneZP 阅读(242) 评论(0) 推荐(0)
POJ1679(次小生成树）
摘要：The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:24201Accepted:8596DescriptionGiven a connected undirected graph, tell if its minim... 阅读全文
posted @ 2015-08-16 14:32 JoneZP 阅读(165) 评论(0) 推荐(0)
UVA10487(二分）
摘要：Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set, whic... 阅读全文
posted @ 2015-08-16 14:18 JoneZP 阅读(127) 评论(0) 推荐(0)
ZOJ 2048(Prim 或者 Kruskal)
摘要：HighwaysTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a v... 阅读全文
posted @ 2015-08-12 19:20 JoneZP 阅读(497) 评论(0) 推荐(0)
FZU 1856 The Troop (JAVA高精度）
摘要：Problem 1856 The Troop Accept: 72Submit: 245Time Limit: 1000 mSecMemory Limit : 32768 KB Problem DescriptionThe troop is advancing. The length of the... 阅读全文
posted @ 2015-08-12 10:37 JoneZP 阅读(182) 评论(0) 推荐(0)
HDU1754（线段树）
摘要：I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51036Accepted Submission(s): 20011Problem... 阅读全文
posted @ 2015-08-11 21:37 JoneZP 阅读(199) 评论(0) 推荐(0)
FZU1862(线段树 或者 DP）
摘要：Problem 1862 QueryProblem Accept: 100Submit: 249Time Limit: 2000 mSecMemory Limit : 32768 KB Problem DescriptionThere are N numbers (non-negative int... 阅读全文
posted @ 2015-08-11 21:28 JoneZP 阅读(146) 评论(0) 推荐(0)
ZOJ 1008 Gnome Tetravex(DFS)
摘要：Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KBHart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game,... 阅读全文
posted @ 2015-08-11 10:32 JoneZP 阅读(280) 评论(0) 推荐(0)
ZOJ 1136 Multiple (BFS）
摘要：MultipleTime Limit: 10 Seconds Memory Limit: 32768 KBa program that, given a natural number N between 0 and 4999 (inclusively), and M distinct deci... 阅读全文
posted @ 2015-08-10 23:38 JoneZP 阅读(258) 评论(0) 推荐(0)
关于set和map的用法
摘要：1.set定义：每个元素最多只出现一次，并且默认的是从小到大排序。set遍历:题目http://www.cnblogs.com/ZP-Better/p/4700218.htmlfor(set::iterator it = dict.begin(); it != dict.end(); ++it) c... 阅读全文
posted @ 2015-08-09 19:43 JoneZP 阅读(253) 评论(0) 推荐(0)
离散化
摘要：转：http://blog.csdn.net/gokou_ruri/article/details/7723378方法一： 9 1 0 5 4 与 5 2 1 4 3 的逆序对个数相同。设有4个数：1234567、123456789、12345678、123456排序：123456 1 ... 阅读全文
posted @ 2015-08-09 16:36 JoneZP 阅读(129) 评论(0) 推荐(0)
SPFA模板
摘要：感谢书神的模板！！！int spfa(int s,int n)//单源最短路(s为起点，n为节点总数){ int u; for (int i=0; i que; que.push(s); vis[s]=true; dis[s]=0; while (!que.emp... 阅读全文
posted @ 2015-08-09 15:05 JoneZP 阅读(158) 评论(0) 推荐(0)
Floyd 无向图模板
摘要：这是无向图的void Floyd(){ memset(v, 0x3f, sizeof v); for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) v[i][j] = map[i][j]; for... 阅读全文
posted @ 2015-08-09 11:27 JoneZP 阅读(388) 评论(0) 推荐(0)
POJ 2263 Heavy Cargo（Floyd + map）
摘要：Heavy CargoTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3768Accepted: 2013DescriptionBig Johnsson Trucks Inc. is a company specialized in ... 阅读全文
posted @ 2015-08-09 11:18 JoneZP 阅读(571) 评论(0) 推荐(0)
POJ 2579 Fiber Network(状态压缩+Floyd)
摘要：Fiber NetworkTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3328Accepted: 1532DescriptionSeveral startup companies have decided to build a b... 阅读全文
posted @ 2015-08-09 11:05 JoneZP 阅读(216) 评论(0) 推荐(0)
POJ 3259 Wormholes( bellmanFord判负环）
摘要：WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 36425Accepted: 13320DescriptionWhile exploring his many farms, Farmer John has disco... 阅读全文
posted @ 2015-08-09 10:43 JoneZP 阅读(236) 评论(0) 推荐(0)
POJ1094 Sorting It All Out（拓扑排序）
摘要：Sorting It All OutTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 30110Accepted: 10411DescriptionAn ascending sorted sequence of distinct val... 阅读全文
posted @ 2015-08-05 23:12 JoneZP 阅读(150) 评论(0) 推荐(0)
HDU5137 How Many Maos Does the Guanxi Worth(枚举+dijkstra）
摘要：How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 760Accepted ... 阅读全文
posted @ 2015-08-04 21:34 JoneZP 阅读(463) 评论(0) 推荐(0)
POJ3268 Silver Cow Party(dijkstra+矩阵转置）
摘要：Silver Cow PartyTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 15156Accepted: 6843DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) con... 阅读全文
posted @ 2015-08-04 10:32 JoneZP 阅读(185) 评论(0) 推荐(0)
ZOJ2913Bus Pass(BFS+set)
摘要：Bus PassTime Limit: 5 Seconds Memory Limit: 32768 KBYou travel a lot by bus and the costs of all the seperate tickets are starting to add up.Theref... 阅读全文
posted @ 2015-08-03 19:48 JoneZP 阅读(477) 评论(0) 推荐(0)
HDU1242 Rescue(BFS+优先队列）
摘要：RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20938Accepted Submission(s): 7486Problem Des... 阅读全文
posted @ 2015-08-03 10:59 JoneZP 阅读(220) 评论(0) 推荐(0)
转（havel 算法）
摘要：http://www.cnblogs.com/wally/p/3281361.htmlpoj 1659(havel算法)题目链接：http://poj.org/problem?id=1659思路： havel算法的应用：（1）对序列从大到小进行排序。（2）设最大的度数为 t ，把最大的度数置0，然后... 阅读全文
posted @ 2015-08-02 19:30 JoneZP 阅读(343) 评论(0) 推荐(0)
ZOJ3761（并查集+树的遍历)
摘要：Easy billiardsTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeEdward think a game of billiards is too long and boring. So he invented a ... 阅读全文
posted @ 2015-08-02 14:35 JoneZP 阅读(297) 评论(0) 推荐(0)