- 博客(470)
- 资源 (9)
- 收藏
- 关注
原创 【01背包方案数】POJ-3132 Sum of Different Primes
Sum of Different PrimesTime Limit: 5000MS Memory Limit: 65536K DescriptionA positive integer may be expressed as a sum of different prime numbers (primes), in
2014-11-04 18:29:33 824
原创 【二分图|最小点权覆盖】POJ-2125 Destroying The Graph
Destroying The GraphTime Limit: 2000MS Memory Limit: 65536K Special JudgeDescriptionAlice and Bob play the following game. First, Alice draws some directed
2014-11-03 22:08:55 853
原创 【二分图|最大匹配】POJ-1469 COURSES
COURSESTime Limit: 1000MS Memory Limit: 10000K DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses.
2014-11-02 22:25:23 718
原创 手写快速排序【随机数作基数】
/*ID: j.sure.1PROG:LANG: C++*//****************************************/#include #include #include #include #include #include #include #include #include #include #include #include #d
2014-11-02 15:49:12 1167
原创 【二分图|最大匹配】POJ-1325 Machine Schedule
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000K DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has be
2014-11-01 11:12:15 701
原创 【二分图|最大匹配】ZOJ-1654 Place the Robots
Place the RobotsTime Limit: 5 Seconds Memory Limit: 32768 KBRobert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Gi
2014-10-31 17:20:31 709
转载 【二分图|最小点覆盖集】König定理及其证明
二分图最大匹配的König定理及其证明 如果你看不清楚第二个字母,下面有一个大号字体版本:二分图最大匹配的König定理及其证明 本文将是这一系列里最短的一篇,因为我只打算把König定理证了,其它的废话一概没有。 以下五个问题我可能会在以后的文章里说,如果你现在很想知道的话,网上去找找答案: 1. 什么是二分图; 2. 什么是二分
2014-10-30 22:21:50 1066
原创 【费用流消圈】POJ-2175 Evacuation Plan
Evacuation PlanTime Limit: 1000MS Memory Limit: 65536K Special JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelter
2014-10-27 19:59:30 921
原创 【高精度乘法模板】AOJ-406 Multiplication
MultiplicationTime Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 64 MBDescriptionTo calculate the result of two numbers by multiply themInputThe input consists
2014-10-26 11:54:45 786
原创 【最小费用最大流】POJ-2516 Minimum Cost
Minimum CostTime Limit: 4000MS Memory Limit: 65536K DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale are
2014-10-25 21:58:43 884
转载 HostTool
转自:zhutianlong国内IT开发者都会面临访问google等国外网站不稳定的问题,这些问题一方面可以通过番墙来解决,也可以通过修改本机hosts文件来解决。之前在Windows上一直使用HostsTool这个国人的修改hosts文件软件,切换到Ubuntu环境自然也首先想到这个工具。Ubuntu安装方法如下:1、下载最新版HostsTool for linux
2014-10-24 16:23:17 1641
原创 【最小费用最大流】POJ-2195 Going Home
Going HomeTime Limit: 1000MS Memory Limit: 65536K DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one
2014-10-24 16:14:05 701
原创 【线性规划+最小费用最大流】Vijos-1825 志愿者招募
P1825志愿者招募Accepted标签:NOI2008描述申奥成功后,布布经过不懈努力,终于成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题:为即将启动的奥运新项目招募一批短期志愿者。经过估算,这个项目需要N 天才能完成,其中第i 天至少需要Ai 个人。布布通过了解得知,一共有M 类志愿者可以
2014-10-23 18:27:03 1076
原创 【有上下界最大费用可行流】HDU-4862 Jump
JumpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 930 Accepted Submission(s): 377Problem DescriptionThere are n*m grids,
2014-10-20 16:17:45 1186
原创 【最大费用最大流】POJ-3422 Kaka's Matrix Travels
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536K DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix t
2014-10-18 20:31:01 1088
原创 费用流模板 spfa+EK
const int N = 1000, M = 1e5;struct Node { int u, v, w, c; int next;}edge[M];int pre[N], path[N], dis[N];bool inq[N];bool spfa(int S, int T, int n){ int u; for(int i = 0; i < n ; i++) { in
2014-10-17 21:55:13 862
转载 【有上下界的网络流】
转自相对于一般的网络流,有上下界的网络流的某些边多出了流量下界的限制,如边u->v,上下界为high、low,如果有流经过这条边,这个流必须在[low,high]这个区间内。这类题目主要要求解决下面三个问题,“有源汇、无源汇的可行流”、“有源汇的最大流”、“有源汇的最小流”,注意这里所说的源汇是原网络中的源汇,分别记为s、t。 这类题目的难点在于下界的限制很难处理,我们将所有有下
2014-10-17 15:11:07 624
原创 【有源汇有上下界最大流】ZOJ-3229 Shoot the Bullet
Shoot the BulletTime Limit: 2 Seconds Memory Limit: 32768 KB Special JudgeGensokyo is a world which exists quietly beside ours, separated by a mystical border. It is a utopia where h
2014-10-16 22:34:05 894
原创 【有源汇有上下界最小流】SGU-176 Flow constructions
176. Flow constructiontime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardYou have given the net consisting of nodes and pipes; pipes conn
2014-10-14 17:12:30 800
原创 【有源汇有上下界可行流】POJ-2396(ZOJ-1994) Budget
BudgetTime Limit: 3000MS Memory Limit: 62M Special JudgeDescriptionWe are supposed to make a budget proposal for this multi-site competition. The budget pr
2014-10-12 16:22:25 785
原创 【无源汇有上下界可行流】ZOJ-2314 Reactor Cooling
Reactor CoolingTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeThe terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor t
2014-10-11 23:33:44 811
原创 【最大流】ZOJ-2788 Panic Room
Panic RoomTime Limit: 2 Seconds Memory Limit: 65536 KBIntroductionYou are the lead programmer for the Securitron 9042, the latest and greatest in home security software from Jellern Inc
2014-10-10 16:14:52 785
原创 【最小割+判定唯一性】ZOJ-2587 Unique Attack
Unique AttackTime Limit: 5 Seconds Memory Limit: 32768 KBN supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pai
2014-10-09 21:42:14 1409
原创 【二分答案+枚举】AOJ-215 Mountain Walking
Mountain WalkingTime Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 64 MBJudge By CaseDescriptionFarmer John and Bessie the cow have embarked on one of those 'active' vaca
2014-09-29 19:24:53 870
原创 【最小割+枚举】POJ-1815 Friendship
FriendshipTime Limit: 2000MS Memory Limit: 20000K DescriptionIn modern society, each person has his own friends. Since all the people are very busy, they commun
2014-09-27 21:00:38 644
原创 【最小割】POJ-3308 Paratroopers
ParatroopersTime Limit: 1000MS Memory Limit: 65536K DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Re
2014-09-26 13:14:31 745
原创 【最小割】POJ-3469 Dual Core CPU
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072K Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CPU, Setag
2014-09-24 16:34:12 688
原创 【最大流+混合图欧拉回路】POJ-1637 Sightseeing tour
Sightseeing tourTime Limit: 1000MS Memory Limit: 10000K DescriptionThe city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so tha
2014-09-23 23:48:43 734
原创 【最大流+输出路径】POJ-3436 ACM Computer Factory
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KSpecial Judge DescriptionAs you know, all the computers used for ACM contests must be identical,
2014-09-22 22:07:11 1138
原创 【最大流】LightOJ-1153 Internet Bandwidth
1153 - Internet BandwidthPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBOn the Internet, machines (nodes) are richly interconnect
2014-09-21 23:14:11 1257
转载 网络流题集
转自:夏天的风【HDU】1532Drainage Ditches(入门) [最大流]3549 Flow Problem(入门) [最大流]3572 Task Schedule(基础) [最大流]任务分配,判断满流2732 Leapin' Lizards(较难) [最大流]3338 Kakuro Extension(较难,好题) [最大流][
2014-09-20 21:06:31 785
原创 【最大流+最短路+二分】POJ-2391 Ombrophobic Bovines
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536K DescriptionFJ's cows really hate getting wet so much that the mere thought of getting caught in the r
2014-09-20 20:14:08 755
转载 各种int的取值范围
unsigned int 0~4294967295 int -2147483648~2147483647 unsigned long 0~4294967295long -2147483648~2147483647long long的最大值:9223372036854775807long long的最小值:-9223372036854775808unsig
2014-09-20 09:45:25 1181
原创 【最大流】POJ-1087 A Plug for UNIX
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536K DescriptionYou are in charge of setting up the press room for the inaugural meeting of the United Nations
2014-09-19 16:37:34 722
原创 【最大流】POJ-1459 Power Network
Power NetworkTime Limit: 2000MS Memory Limit: 32768K DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power
2014-09-19 14:54:08 783
原创 【最大流+最短路+二分】POJ-2112 Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000K Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the c
2014-09-19 13:05:26 790
原创 【最大流】POJ-1149 PIGS
PIGSTime Limit: 1000MS Memory Limit: 10000K DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse becaus
2014-09-17 18:20:54 613
原创 【最大流】POJ-1273 Drainage Ditches
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000K DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch
2014-09-15 17:16:28 669
Code::Blocks13.12 汉化+多方案主题(代码高亮)+智能缩进
2014-04-20
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人