06 2016 档案

HDU 4725 The Shortest Path in Nya Graph (最短路)
摘要：The Shortest Path in Nya Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description This is a very easy proble 阅读全文
posted @ 2016-06-29 17:14 季末Despair 阅读(262) 评论(0) 推荐(0)
POJ 1502 MPI Maelstrom (最短路)
摘要：MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Time Limit: 1000MS Memory Limit: 10000K Description BIT has recently taken delivery of their new 阅读全文
posted @ 2016-06-29 17:01 季末Despair 阅读(279) 评论(0) 推荐(0)
POJ 3268 Silver Cow Party (最短路)
摘要：Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Time Limit: 2000MS Memory Limit: 65536K Description One cow from each of N farms (1 ≤ N ≤ 100 阅读全文
posted @ 2016-06-29 16:58 季末Despair 阅读(120) 评论(0) 推荐(0)
POJ 1797 Heavy Transportation (Dijkstra算法变形)
摘要：Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Time Limit: 3000MS Memory Limit: 30000K Description Background Hugo Heavy is happy. After 阅读全文
posted @ 2016-06-29 16:55 季末Despair 阅读(209) 评论(0) 推荐(0)
HDU 2883 kebab (最大流)
摘要：kebab Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description Almost everyone likes kebabs nowadays (Here a kebab 阅读全文
posted @ 2016-06-28 16:24 季末Despair 阅读(271) 评论(0) 推荐(0)
HDU 3338 Kakuro Extension (最大流)
摘要：Kakuro Extension Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Special Judge Description If you solved problem like  阅读全文
posted @ 2016-06-28 16:10 季末Despair 阅读(173) 评论(0) 推荐(0)
POJ 2195 Going Home (最小费用最大流)
摘要：Going Home Time Limit: 1000MS Memory Limit: 65536K Time Limit: 1000MS Memory Limit: 65536K Description On a grid map there are n little men and n hous 阅读全文
posted @ 2016-06-27 17:07 季末Despair 阅读(163) 评论(0) 推荐(0)
HDU 2732 Leapin' Lizards (最大流)
摘要：Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description Your platoon of wandering lizards has ent 阅读全文
posted @ 2016-06-27 17:05 季末Despair 阅读(207) 评论(0) 推荐(0)
POJ 2516 Minimum Cost (最小费用最大流)
摘要：Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In hi 阅读全文
posted @ 2016-06-27 16:57 季末Despair 阅读(186) 评论(0) 推荐(0)
POJ 1087 A Plug for UNIX (最大流)
摘要：A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Description You are in charge of setting up the press room for the inaugural meeting of the Un 阅读全文
posted @ 2016-06-26 23:24 季末Despair 阅读(186) 评论(0) 推荐(0)
POJ 3281 Dining (最大流)
摘要：Dining Time Limit: 2000MS Memory Limit: 65536K Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and s 阅读全文
posted @ 2016-06-26 23:20 季末Despair 阅读(128) 评论(0) 推荐(0)
HDU 3605 Escape (最大流)
摘要：Escape Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Description 2012 If this is the end of the world how to do? I 阅读全文
posted @ 2016-06-25 17:40 季末Despair 阅读(143) 评论(0) 推荐(0)
POJ 1149 PIGS (最大流)
摘要：PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19711 Accepted: 9035 Description Mirko works on a pig farm that consists of M locked p 阅读全文
posted @ 2016-06-25 17:34 季末Despair 阅读(201) 评论(0) 推荐(0)
POJ 3436 ACM Computer Factory (最大流)
摘要：ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6773 Accepted: 2379 Special Judge Description As you know, all the com 阅读全文
posted @ 2016-06-25 17:27 季末Despair 阅读(167) 评论(0) 推荐(0)
HDU 4289 Control (最小割最大流)
摘要：Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description You, the head of Department of Security, recently 阅读全文
posted @ 2016-06-23 17:06 季末Despair 阅读(177) 评论(0) 推荐(0)
POJ 1459 Power Network (最大流)
摘要：Power Network Time Limit: 2000MS Memory Limit: 32768K Description A power network consists of nodes (power stations, consumers and dispatchers) connec 阅读全文
posted @ 2016-06-23 16:17 季末Despair 阅读(150) 评论(0) 推荐(0)
HDU 3549 Flow Problem (最大流)
摘要：Flow Problem Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Problem Description Network flow is a well-known difficu 阅读全文
posted @ 2016-06-23 15:56 季末Despair 阅读(189) 评论(0) 推荐(0)
HDU 1532 Drainage Ditches (最大流)
摘要：Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description Every time it rains on Farmer Jo 阅读全文
posted @ 2016-06-22 13:10 季末Despair 阅读(117) 评论(0) 推荐(0)
POJ 1236 Network of Schools (有向图的强连通分量)
摘要：Network of Schools Time Limit: 1000MS Memory Limit: 10000K Description A number of schools are connected to a computer network. Agreements have been d 阅读全文
posted @ 2016-06-21 15:39 季末Despair 阅读(150) 评论(0) 推荐(0)
HDU 4635 Strongly connected (有向图的强连通分量)
摘要：Strongly connected Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Give a simple directed graph w 阅读全文
posted @ 2016-06-20 21:04 季末Despair 阅读(191) 评论(0) 推荐(0)
HDU 1269 迷宫城堡
摘要：迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和 阅读全文
posted @ 2016-06-20 19:29 季末Despair 阅读(152) 评论(0) 推荐(0)
【转】有向图强连通分量的Tarjan算法
摘要：原文地址：https://www.byvoid.com/blog/scc-tarjan/ [有向图强连通分量] 在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子 阅读全文
posted @ 2016-06-20 18:49 季末Despair 阅读(130) 评论(0) 推荐(0)
HDU 2544 最短路
摘要：最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description 在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服 阅读全文
posted @ 2016-06-18 23:38 季末Despair 阅读(121) 评论(0) 推荐(0)
Codeforces Round #358 (Div. 2) Alyona and Strings
摘要：题目连接： http://www.codeforces.com/contest/682/problem/D Description After returned from forest, Alyona started reading a book. She noticed strings s and 阅读全文
posted @ 2016-06-18 19:21 季末Despair 阅读(278) 评论(0) 推荐(0)
Codeforces Round #358 (Div. 2) Alyona and the Tree
摘要：题目连接： http://www.codeforces.com/contest/682/problem/C Description Alyona decided to go on a diet and went to the forest to get some apples. There she 阅读全文
posted @ 2016-06-18 19:13 季末Despair 阅读(228) 评论(0) 推荐(0)
Codeforces Round #357 (Div. 2) Runaway to a Shadow
摘要：题目连接： http://www.codeforces.com/contest/681/problem/E Description Dima is living in a dormitory, as well as some cockroaches. At the moment 0 Dima saw 阅读全文
posted @ 2016-06-16 20:19 季末Despair 阅读(174) 评论(0) 推荐(0)
Codeforces Round #357 (Div. 2) Heap Operations
摘要：题目连接： http://www.codeforces.com/contest/681/problem/C Description Petya has recently learned data structure named "Binary heap". The heap he is now op 阅读全文
posted @ 2016-06-16 20:15 季末Despair 阅读(139) 评论(0) 推荐(0)
POJ-1847 Tram
摘要：Tram Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a swit 阅读全文
posted @ 2016-06-13 00:07 季末Despair 阅读(174) 评论(0) 推荐(0)
【转】一些图论、网络流入门题总结、汇总
摘要：最短路问题此类问题类型不多，变形较少 POJ 2449 Remmarguts' Date(中等)http://acm.pku.edu.cn/JudgeOnline/problem?id=2449题意：经典问题：K短路解法：dijkstra+A*(rec)，方法很多相关：http://acm.pku. 阅读全文
posted @ 2016-06-12 23:03 季末Despair 阅读(139) 评论(0) 推荐(0)
POJ-2398 Toy Storage
摘要：Toy Storage Description Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza 阅读全文
posted @ 2016-06-08 11:44 季末Despair 阅读(204) 评论(0) 推荐(0)
POJ-2318 TOYS
摘要：TOYS Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts 阅读全文
posted @ 2016-06-08 11:20 季末Despair 阅读(198) 评论(0) 推荐(0)
【转】计算几何题目推荐
摘要：打算转下来好好做计算几何了。 原文地址：http://blog.sina.com.cn/s/blog_49c5866c0100f3om.html 其实也谈不上推荐，只是自己做过的题目而已，甚至有的题目尚未AC，让在挣扎中。之所以推荐计算几何题，是因为，本人感觉ACM各种算法中计算几何算是比较实际的算 阅读全文
posted @ 2016-06-06 21:31 季末Despair 阅读(176) 评论(0) 推荐(0)
大素数判断和素因子分解（miller-rabin，Pollard_rho算法）
摘要：#include #include #include #include #include #include using namespace std; //**************************************************************** // Miller_Rabin 算法进行素数测试 //速度快，而且可以判断 =c)a%=c; ... 阅读全文
posted @ 2016-06-02 00:31 季末Despair 阅读(246) 评论(0) 推荐(0)
【转】[专题学习][计算几何]
摘要：原文地址：http://www.cnblogs.com/ch3656468/archive/2011/03/02/1969303.html 基本的叉积、点积和凸包等东西就不多说什么了，网上一搜一大堆，切一些题目基本熟悉了就差不多了。 一些基本的题目可以自己搜索，比如这个blog：http://blo 阅读全文
posted @ 2016-06-02 00:21 季末Despair 阅读(227) 评论(0) 推荐(0)