- 博客(6)
- 收藏
- 关注
原创 POJ - 1459 Power Network(网络流-最大流)
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <=
2017-07-28 11:04:01 226
原创 HDU - 1853 Cyclic Tour(网络流-最小费用最大流)
There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city bel
2017-07-28 10:41:22 241
原创 HDU - 1285 确定比赛名次(拓扑排序)
有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。Input输入有若干组,每组中的第一行为二个数N(1<=N<=500),M;其中N表示队伍的个数,M表示接
2017-07-14 17:34:41 224
原创 codeforces747C Servers(思维)
There are n servers in a laboratory, each of them can perform tasks. Each server has a unique id — integer from 1 to n.It is known that during the day q tasks will come, the i-th of them is charac
2017-07-12 13:59:06 265
原创 Pagodas(思维)
nn pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from 11 to nn. However, only two of them (labelled aa and bb, where 1≤a≠b≤n1≤a≠b≤n) withsto
2017-07-11 09:26:43 589
原创 codeforces792E Colored Ball(贪心加枚举)
There are n boxes with colored balls on the table. Colors are numbered from 1 to n. i-th box contains ai balls, all of which have color i. You have to write a program that will divide all balls into s
2017-07-10 21:37:44 328
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人