- 博客(28)
- 资源 (11)
- 收藏
- 关注
原创 杭电3549 Flow Problem(最大流Dinic+前向星模板)
Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8276 Accepted Submission(s): 3849Problem DescriptionNetwork flow is a
2014-09-26 11:52:51 899
原创 poj 1061 青蛙的约会(扩展gcd)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 91365 Accepted: 16762Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面
2014-09-21 18:18:10 675
原创 NYOJ144 小珂的苦恼(扩展gcd的简单运用)
小珂的苦恼时间限制:1000 ms | 内存限制:1000 KB难度:2描述 小珂是一名初中生,她现在很苦恼,因为老师布置了一个让她苦恼的作业,你能不能帮助她呢?题目信息如下。 已知二元一次方程 a*x+b*y=n, 判断这个二元一次方程有没有整数解,x,y为未知数,其中a,b,n都为整数且不等于零,同时满足0输入第一行有一个整数0输出存
2014-09-20 18:07:24 930
原创 poj2135 Farm Tour(最小费用流)
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11761 Accepted: 4380DescriptionWhen FJ's friends visit him on the farm, he likes to show them a
2014-09-20 16:53:57 896 1
原创 NOOJ61 传纸条(一)(双线dp+费用流)
传纸条(一)时间限制:2000 ms | 内存限制:65535 KB难度:5描述小渊和小轩是好朋友也是同班同学,他们在一起总有谈不完的话题。一次素质拓展活动中,班上同学安排做成一个m行n列的矩阵,而小渊和小轩被安排在矩阵对角线的两端,因此,他们就无法直接交谈了。幸运的是,他们可以通过传纸条来进行交流。纸条要经由许多同学传到对方手里,小渊坐在矩阵的左上角,
2014-09-18 13:21:49 922
原创 杭电2199 Can you solve this equation?(二分)
Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8725 Accepted Submission(s): 4024Problem DescriptionN
2014-09-17 20:52:43 781
原创 NYOJ239 月老的难题(匈牙利算法)
月老的难题时间限制:1000 ms | 内存限制:65535 KB难度:4描述月老准备给n个女孩与n个男孩牵红线,成就一对对美好的姻缘。现在,由于一些原因,部分男孩与女孩可能结成幸福的一家,部分可能不会结成幸福的家庭。现在已知哪些男孩与哪些女孩如果结婚的话,可以结成幸福的家庭,月老准备促成尽可能多的幸福家庭,请你帮他找出最多可能促成的幸福
2014-09-16 17:03:03 789
原创 NYOJ43 24 Point game(DFS)
24 Point game时间限制:3000 ms | 内存限制:65535 KB难度:5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is to find an expressi
2014-09-16 15:54:12 798
原创 杭电2588 GCD(欧拉函数+gcd的应用)
GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1080 Accepted Submission(s): 492Problem DescriptionThe greatest common divisor
2014-09-16 11:49:55 870
原创 杭电5000 Clone(母函数变形)
CloneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 444 Accepted Submission(s): 214Problem DescriptionAfter eating food from Che
2014-09-15 20:24:57 720
原创 杭电4009 Transfer water(最小树形图)
Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3853 Accepted Submission(s): 1380Problem DescriptionXiaoA lives in
2014-09-11 21:16:59 760
原创 poj1273 Drainage Ditches(最大流入门 EK+Dinic模板)
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56697 Accepted: 21784DescriptionEvery time it rains on Farmer John's fields, a pond form
2014-09-10 23:15:32 645
原创 杭电1996 汉诺塔VI(规律)
汉诺塔VITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1477 Accepted Submission(s): 1045Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,
2014-09-10 18:48:23 866
原创 杭电1995 汉诺塔V(规律)
汉诺塔VTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2527 Accepted Submission(s): 1502Problem Description用1,2,...,n表示n个盘子,称为1号盘,2号
2014-09-10 18:33:54 747
原创 杭电1207 汉诺塔II(规律)
汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4979 Accepted Submission(s): 2441Problem Description经典的汉诺塔问题经常作为一个递归的经典例题存在。
2014-09-10 18:16:14 747
原创 杭电2121 Ice_cream’s world II(不定根最小树形图)
Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2832 Accepted Submission(s): 662Problem DescriptionAfter awar
2014-09-10 09:22:04 848
原创 杭电1150 Machine Schedule(匈牙利算法模板)
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5872 Accepted Submission(s): 2957Problem DescriptionAs we all kno
2014-09-08 16:16:02 645
原创 杭电1556 Color the ball(树状数组)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9577 Accepted Submission(s): 4926Problem DescriptionN个气球排成一排,从左到右依次
2014-09-06 21:36:48 800
原创 杭电1200 To and Fro(睡前一水)
To and FroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4724 Accepted Submission(s): 3292Problem DescriptionMo and Larry have d
2014-09-06 20:41:27 826
原创 hdu1142 A Walk Through the Forest(前向星+SPFA解法)
A Walk Through the ForestTime Limit: 2000/1000 MS (java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5804 Accepted Submission(s): 2144Problem DescriptionJimm
2014-09-06 20:15:06 707
原创 poj 2387 Til the Cows Come Home(最短路SPFA+Dijkstra)
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30503 Accepted: 10307DescriptionBessie is out in the field and wants to get back t
2014-09-06 15:44:25 782
原创 杭电 2057 A+B Again(睡前一水--16进制控制)
A + B AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15226 Accepted Submission(s): 6642Problem DescriptionThere must be man
2014-09-05 19:51:49 1163
原创 NYOJ 35 表达式求值(非递归+栈)
表达式求值时间限制:3000 ms | 内存限制:65535 KB难度:4描述ACM队的mdd想做一个计算器,但是,他要做的不仅仅是一计算一个A+B的计算器,他想实现随便输入一个表达式都能求出它的值的计算器,现在请你帮助他来实现这个计算器吧。比如输入:“1+2/4=”,程序就输出1.50(结果保留两位小数)输入第一行输入一个整数n,共有n组测试数
2014-09-04 19:02:37 957 3
原创 杭电1176 免费馅饼(数塔dp)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25878 Accepted Submission(s): 8825Problem Description都说天上不会掉馅饼,但有一天gameboy正走在
2014-09-03 17:01:51 769
原创 杭电2639 Bone Collector II(01背包第K优解)
Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2287 Accepted Submission(s): 1198Problem DescriptionThe title of
2014-09-03 14:19:56 1042 2
原创 poj2299 Ultra-QuickSort&&NYOJ117 求逆序数 (树状数组求逆序对数+离散化)+(归并排序)
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 42087 Accepted: 15296DescriptionIn this problem, you have to analyze a particular sorting
2014-09-02 22:53:21 746
原创 poj3164 Command Network(最小树形图)
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12893 Accepted: 3737DescriptionAfter a long lasting war on words, a war on arms finall
2014-09-02 17:51:09 624
原创 NYOJ119 士兵杀敌(三)&&poj3264 Balanced Lineup(线段树)
士兵杀敌(三)时间限制:2000 ms | 内存限制:65535 KB难度:5描述南将军统率着N个士兵,士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较,计算出两个人的杀敌数差值,用这种方法一方面能鼓舞杀敌数高的人,另一方面也算是批评杀敌数低的人,起到了很好的效果。所以,南将军经常问军师小工第i号士兵到第j号
2014-09-01 16:43:28 797
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人