- 博客(59)
- 收藏
- 关注
RSS订阅原创 hdu1203--D - I NEED A OFFER!（转化01背包）
D - I NEED A OFFER!Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要
2014-08-28 09:03:05
1166
原创 hdu1171--C - Big Event in HDU（多重背包+二进制优化）
C - Big Event in HDUTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNowadays, we all know that Computer College is the biggest d
2014-08-28 08:56:21
933
原创 poj1014+hdu1059--A - Dividing(多重背包，二进制优化)
A - DividingTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionMarsha and Bill own a collection of marbles. They want to split t
2014-08-28 08:53:56
856
原创 hdu1561--H - ACboy needs your help(树形dp)
H - ACboy needs your helpTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionACboy has N courses this term, and he plans to spend
2014-08-27 21:26:20
778
原创 poj2942--F - Knights of the Round Table(圆桌骑士，经典连通分量)
F - Knights of the Round TableTime Limit:7000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionBeing a knight is a very attractive career: s
2014-08-26 19:41:43
1030
原创 poj3352--E - Road Construction(无向图加边成双连通)
E - Road ConstructionTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIt's almost summer time, and that means that it's almos
2014-08-26 14:28:51
1223
原创 poj1144--D - Network（连通分量，割点）
D - NetworkTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA Telephone Line Company (TLC) is establishing a new telephone cabl
2014-08-26 14:24:18
675
原创 poj1523--C - SPF（连通分量，求割点）
C - SPFTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionConsider the two networks shown below. Assuming that data moves arou
2014-08-26 11:07:36
970
原创 zoj2588（连通分量，求解无向图的割边）
B - Burning BridgesTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status DescriptionFerry Kingdom is a nice little country located on N islands
2014-08-26 11:00:07
841
原创 CodeForces 442C Artem and Array(贪心)
E - Artem and ArrayTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2014-08-21)DescriptionArtem h
2014-08-23 09:13:05
1495
原创 poj2983--Is the Information Reliable?（差分约束）
Is the Information Reliable?Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 11125 Accepted: 3492DescriptionThe galaxy war between the Empire Draco and
2014-08-22 21:48:12
1027
原创 poj3159--Candies(差分约束)
CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 23131 Accepted: 6224DescriptionDuring the kindergarten days, flymouse was the monitor of his cla
2014-08-22 21:44:33
1379
原创 CodeForces 460C--- Present（二分+贪心）
C. Presenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle beaver is a beginner programmer, so infor
2014-08-21 20:33:12
1800
原创 hdu2686--Matrix(拆点+最大费用)
MatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1665 Accepted Submission(s): 901Problem DescriptionYifenfei very like pla
2014-08-21 20:20:37
732
原创 poj3422--Kaka's Matrix Travels（拆点，最大费用）
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7802 Accepted: 3138DescriptionOn an N × N chessboard with a non-negative number in
2014-08-21 20:07:12
918
原创 CodeForces 440C One-Based Arithmetic(递归，dfs)
A - One-Based ArithmeticTime Limit:500MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Appoint description: System Crawler (2014-08-21)Description
2014-08-21 19:58:57
1170
原创 poj2135--Farm Tour
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11495 Accepted: 4257DescriptionWhen FJ's friends visit him on the farm, he likes to show them aro
2014-08-20 21:27:11
812
原创 poj2516--Minimum Cost(费用流，分别建图)
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 13531 Accepted: 4635DescriptionDearboy, a goods victualer, now comes to a big problem, and he
2014-08-20 20:47:58
1013
原创 poj2195--Going Home(最小费用最大流)
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17975 Accepted: 9155DescriptionOn a grid map there are n little men and n houses. In each unit t
2014-08-20 20:32:46
919
原创 2014多校1002--hdu4961--Boring Sum
Boring SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 80 Accepted Submission(s): 39Problem DescriptionNumber theory is in
2014-08-19 18:57:19
912
原创 2014多校1009--hdu4968--Improving the GPA(平均成绩的最大最小平均学分)
Improving the GPATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 65 Accepted Submission(s): 43Problem DescriptionXueba: Using
2014-08-19 18:39:25
1256
原创 2014多校1011--hdu--4097--Killing Monsters（塔防，线段树超时。。）
Killing MonstersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 107 Accepted Submission(s): 54Problem DescriptionKingdom Rush
2014-08-19 18:31:38
1162
原创 zoj3792--Romantic Value(最大流+最小割，求解割边)
Romantic Value Time Limit: 2 Seconds Memory Limit: 65536 KB Farmer John is a diligent man. He spent a lot of time building roads between his farms. From his point of view, every ro
2014-08-19 10:25:12
866
原创 poj1459--Power Network（最大流EK、）
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23114 Accepted: 12103DescriptionA power network consists of nodes (power stations, consumers
2014-08-18 20:07:00
909
原创 hdu3572--Task Schedule(最大流+两种优化方法，dinic)
Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3651 Accepted Submission(s): 1271Problem DescriptionOur geometry pri
2014-08-18 19:59:12
1161
原创 poj1273--Drainage Ditches（最大流）
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56084 Accepted: 21547DescriptionEvery time it rains on Farmer John's fields, a pond forms
2014-08-18 19:49:25
749
原创 hdu3549--Flow Problem(初识最大流)
Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 7870 Accepted Submission(s): 3664Problem DescriptionNetwork flow is a
2014-08-18 19:44:18
1471
原创 poj3080--Blue Jeans（字符串匹配）
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12233 Accepted: 5307DescriptionThe Genographic Project is a research partnership between IBM and
2014-08-15 16:03:09
821
原创 hdu1498--50 years, 50 colors(二分匹配，题意。。。)
50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1617 Accepted Submission(s): 881Problem DescriptionOn Octorber
2014-08-15 13:20:59
1080
原创 hdu1828 Picture(线段树+离散化+扫描线)两种方法
C - PictureTime Limit:2000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA number of rectangular posters, photographs and other pictures of
2014-08-12 21:14:51
1676
原创 hdu1255--覆盖的面积(线段树+离散化+扫描线)
E - 覆盖的面积Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个
2014-08-12 18:23:05
982
原创 poj3277--City Horizon(线段树+离散化+扫描线)
City HorizonTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16206 Accepted: 4414DescriptionFarmer John has taken his cows on a trip to the city! As the
2014-08-11 21:12:44
1904
原创 poj1151-- Atlantis(线段树+离散化+扫描线)
AtlantisTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status DescriptionThere are several ancient Greek texts that contain descriptions of
2014-08-11 17:03:47
3762
原创 hdu1505--City Game(扫描线+坑啊 )
City GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4572 Accepted Submission(s): 1938Problem DescriptionBob is a strategy
2014-08-11 10:46:30
942
2
原创 hdu1573X问题（不互素的中国剩余定理）
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3295 Accepted Submission(s): 1068Problem Description求在小于等于N的正整数中有多少个X满足：X mod
2014-08-10 18:46:15
2106
原创 FZU1759 Super A^B mod C（快速幂求余+ a^b%c = a^( b%phic+phic )%c）
Problem 1759 Super A^B mod CAccept: 596 Submit: 2010Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGiven A,B,C, You should quickly calculate the result of A^B m
2014-08-09 21:50:55
1477
原创 素数筛，单点的欧拉函数，筛法求欧拉函数
int prime[maxn] , vis[maxn] ;int sieve(int n){ int m = (int)sqrt(n+0.5) , i , j ; for(i = 2 ; i <= m ; i++) if( !vis[i] ) i { for(j = i*i ; j <= n ; j += i
2014-08-09 21:06:22
761
原创 hdu2852--KiKi's K-Number(线段树，求第k个数)
KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2546 Accepted Submission(s): 1174Problem DescriptionFor the k-th
2014-08-09 19:24:12
1019
原创 hdu2795Billboard(线段树，找第一个大于w的点)
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10676 Accepted Submission(s): 4728Problem DescriptionAt the entrance to
2014-08-09 11:17:09
1133
原创 Codeforces Round #260 (Div. 2)C. Boredom（dp）
C. Boredomtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlex doesn't like boredom. That's why whenever he
2014-08-09 10:19:14
914
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人