关闭

Educational Codeforces Round 27 A—D 题解

这里是传送门 A. Chess Tourney time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Berland annual chess tournament...
阅读(581) 评论(0)

POJ 3281 Dining(拆点+最大流)

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19123 Accepted: 8534 Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous mea...
阅读(252) 评论(0)

HDU 2732 Leapin' Lizards(拆点+最大流)

Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3015 Accepted Submission(s): 1234 Problem Description Your platoon of wandering lizards has entered a strange room in the labyrin...
阅读(363) 评论(0)

Codeforces Round #429 (Div. 2) A-C题解

传送门:点击打开链接 A. Generous Kefa time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day Kefa fou...
阅读(204) 评论(0)

HDU 4289 Control(最大流+拆点)

Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3561 Accepted Submission(s): 1494 Problem Description   You, the head of Department of Security, recently received a top-secret informati...
阅读(251) 评论(0)

UVA 10480 Sabotage (最大流)

Sabotage The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist ...
阅读(321) 评论(0)

GYM 101086 A,F,G,H,L 题解

A. My Friend of Misery time limit per test 3.0 s memory limit per test 256 MB input standard input output standard output With the SCPC2015 getting closer, Noura Boubou,...
阅读(412) 评论(0)

HDU 3339 In Action (0-1背包+最短路)

In Action Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6487 Accepted Submission(s): 2191 Problem Description Since 1945, when the first nuclear bomb was exploded by the Manhattan Project te...
阅读(266) 评论(0)

HDU 5839 Special Tetrahedron(几何+暴力)

Special Tetrahedron Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 843 Accepted Submission(s): 348 Problem Description Given n points which are in three-dimensional space(without repetition)....
阅读(276) 评论(0)

HDU 2066 一个人的旅行(dijkstra)

一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 40079 Accepted Submission(s): 13619 Problem Description 虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自...
阅读(325) 评论(0)

HDU 1074 Doing Homework (dp+状态压缩+路径记录)

Doing Homework Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9864 Accepted Submission(s): 4716 Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot ...
阅读(374) 评论(0)

HDU 1024 Max Sum Plus Plus(最大m子段和)

Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30716 Accepted Submission(s): 10846 Problem Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be...
阅读(422) 评论(0)

HDU 1078 FatMouse and Cheese (记忆化搜索)

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10811 Accepted Submission(s): 4598 Problem Description FatMouse has stored some cheese in a city. The city can be considered ...
阅读(260) 评论(0)

HDU 1160 FatMouse's Speed (dp+路径记录)

FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16972 Accepted Submission(s): 7507 Special Judge Problem Description FatMouse believes that the fatter a mouse is, the faster it...
阅读(90) 评论(0)

POJ 3070 Fibonacci (矩阵快速幂)

Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15807 Accepted: 11106 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:...
阅读(278) 评论(0)
26条 共2页1 2 下一页 尾页
    个人资料
    • 访问:33745次
    • 积分:1558
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:1篇
    • 译文:0篇
    • 评论:13条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏
    最新评论