码迷,mamicode.com
首页 >  
搜索关键字:reward    ( 151个结果
poj 3040 Allowance
AllowanceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1842Accepted: 763DescriptionAs a reward for record milk production, Farmer John has ...
分类:其他好文   时间:2015-05-07 12:19:44    阅读次数:133
POJ 题目3621 Sightseeing Cows(SPFA)
Sightseeing Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8220   Accepted: 2757 Description Farmer John has decided to reward his cows for their hard ...
分类:其他好文   时间:2015-05-03 09:19:59    阅读次数:175
01分数规划POJ3621(最优比例生成环)
Sightseeing CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8218Accepted:2756DescriptionFarmer John has decided to reward his cows for their...
分类:其他好文   时间:2015-04-30 16:06:09    阅读次数:135
HDU 2647 Reward【拓扑排序】
题意:工厂发工资,最低工资是888元,然后比他高一层得人的工资是889,依次类推因为是从工资低的人推到工资高的人,所以反向建图然后就是自己写的时候犯的错误,以为工资是后一个人比前一个人高1元,然后就直接判断是否能形成拓扑序列之后,用n*888+(n-1)*n/2来算了这样不对,是后一层的工资比前一层...
分类:编程语言   时间:2015-04-25 18:03:38    阅读次数:184
HDU2647 Reward(拓扑排序)反向建图
Reward Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4638    Accepted Submission(s): 1416 Problem Description Dandelion's uncle is a ...
分类:编程语言   时间:2015-04-21 22:41:03    阅读次数:172
WinKarst.v12.2.WinALL(岩洞研究和测量作图的软件. 它有三维立体显示测量数据的功能)
WinKarst.v12.2.WinALL(岩洞研究和测量作图的软件. 它有三维立体显示测量数据的功能)Geocentrix.ReWaRD.Professional.v2.5.22 1CD(专为工程师设计的最强有力和便于用户操作的拥有成套工具的防护墙设计软件) |||||||||||||||||||...
分类:Windows程序   时间:2015-04-20 13:10:28    阅读次数:170
(最优比率环) poj3621
Sightseeing CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8197Accepted:2750DescriptionFarmer John has decided to reward his cows for their...
分类:其他好文   时间:2015-04-19 21:09:15    阅读次数:184
hdu 2647 Reward
拓扑排序。每次找到入度为0的点存下来。一次找完后,对这些点计算费用。#include#include#include#include#includeusing namespace std;vectorabc[10005];int rudu[10005];int linshi[10005];int m...
分类:其他好文   时间:2015-04-18 17:18:17    阅读次数:84
hdu 2647 Reward
逆拓扑排序,开始死活a不掉,后来才发现自己记录工资的方法是有问题的.....失策失策啊 #include #include #include #include #define maxn 10000+100 using namespace std; vector >mapp; int head[maxn]; int money[maxn]; int n,m; void topo() { int...
分类:其他好文   时间:2015-04-15 09:43:42    阅读次数:136
hdu 2647 Reward 拓扑排序。
Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a trouble about how to distribute the rewards. The workers will compare their rewards ,and some one m...
分类:编程语言   时间:2015-03-28 11:36:19    阅读次数:213
151条   上一页 1 ... 10 11 12 13 14 ... 16 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!