- 博客(26)
- 资源 (9)
- 收藏
- 关注
RSS订阅原创 Educational Codeforces Round 27 A—D 题解
这里是传送门A. Chess Tourneytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland annual chess tournament
2017-08-23 15:54:44
1048
原创 POJ 3281 Dining（拆点+最大流）
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19123 Accepted: 8534DescriptionCows 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
2017-08-21 16:31:45
662
原创 HDU 2732 Leapin' Lizards(拆点+最大流)
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3015 Accepted Submission(s): 1234Problem DescriptionYour platoon of wandering lizards has entered a strange room in the labyrin
2017-08-20 18:16:03
813
原创 Codeforces Round #429 (Div. 2) A-C题解
传送门：点击打开链接A. Generous Kefatime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Kefa fou
2017-08-20 10:19:14
608
原创 HDU 4289 Control（最大流+拆点）
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3561 Accepted Submission(s): 1494Problem Description You, the head of Department of Security, recently received a top-secret informati
2017-08-18 08:25:34
805
原创 UVA 10480 Sabotage (最大流)
SabotageThe 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
2017-08-17 15:48:55
967
原创 GYM 101086 A,F,G,H,L 题解
A. My Friend of Miserytime limit per test3.0 smemory limit per test256 MBinputstandard inputoutputstandard outputWith the SCPC2015 getting closer, Noura Boubou,
2017-08-16 19:30:34
1389
原创 HDU 3339 In Action (0-1背包+最短路)
In ActionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6487 Accepted Submission(s): 2191Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project te
2017-08-14 11:05:51
666
原创 HDU 5839 Special Tetrahedron（几何+暴力）
Special TetrahedronTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 843 Accepted Submission(s): 348Problem DescriptionGiven n points which are in three-dimensional space(without repetition).
2017-08-13 20:54:11
698
原创 HDU 2066 一个人的旅行（dijkstra）
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40079 Accepted Submission(s): 13619Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自
2017-08-13 11:50:33
876
原创 HDU 1074 Doing Homework （dp+状态压缩+路径记录）
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9864 Accepted Submission(s): 4716Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot
2017-08-12 10:07:13
759
原创 HDU 1024 Max Sum Plus Plus(最大m子段和)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30716 Accepted Submission(s): 10846Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be
2017-08-11 16:56:34
851
原创 HDU 1078 FatMouse and Cheese (记忆化搜索)
FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10811 Accepted Submission(s): 4598Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered
2017-08-10 09:03:38
696
原创 HDU 1160 FatMouse's Speed （dp+路径记录）
FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16972 Accepted Submission(s): 7507Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it
2017-08-10 08:34:42
397
原创 POJ 3070 Fibonacci (矩阵快速幂)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15807 Accepted: 11106DescriptionIn 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:
2017-08-09 09:28:07
641
原创 动态规划专题(持续更新中)
HDU 1159 Common Subsequence传送门：点击打开链接最长公共子序列，模板题。dp[i][j]表示第一个串中前i个字符跟第二个串中前j个字符的相等数目。状态转移方程：如果两者相等 dp[i][j]=dp[i-1][j-1]+1;否则 dp[i][j]=max(dp[i-1][j],dp[i][j-1])。题解：点击打开链接H
2017-08-07 20:19:23
430
原创 HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40087 Accepted Submission(s): 18464Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Ju
2017-08-07 19:32:18
924
原创 HDU 5543 Pick The Sticks（0-1背包）
Pick The SticksTime Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2063 Accepted Submission(s): 657Problem DescriptionThe story happened long long ago. One day, Cao Cao made a special order ca
2017-08-07 19:26:27
789
原创 HDU 1159 Common Subsequence （最长公共子序列）
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40565 Accepted Submission(s): 18717Problem DescriptionA subsequence of a given sequence is the given sequence with some elem
2017-08-07 19:05:33
807
原创 Educational Codeforces Round 26 E. Vasya's Function(数论)
E. Vasya's Functiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is studying number theory. He has denoted a function f(a, b) such that:f(a, 0) = 0;f(a, b) = 1 + f(a, b - gcd(a, b)), wher
2017-08-06 09:29:52
727
原创 Educational Codeforces Round 26 D Round Subset
D. Round Subsettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's call the roundness of the number the number of zeros to which it ends.You have an array of n numbers. You need to choose a sub
2017-08-05 10:58:52
1045
原创 Educational Codeforces Round 26 A—C
传送门：点击打开链接A. Text Volumetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a text of sin
2017-08-04 12:00:16
789
原创 HDU 2838 Cow Sorting(树状数组求逆序数)
Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3599 Accepted Submission(s): 1256Problem DescriptionSherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. E
2017-08-03 19:32:32
587
原创 HDU 1166 敌兵布阵(树状数组)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 94731 Accepted Submission(s): 39972Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要
2017-08-03 15:38:53
553
原创 网络流总结(持续更新中)
什么是网络流1.我自己理解的网络流我对网络流的理解就是，给定一个有向图，这个有向图有一种特点，都可以看成从某个点开始，我们称之为源点，一般情况下都将此点定位第一个点，即初始点，所有的点最终都会在一个点会和，我们称之为汇点，通常将此点定位为n，也就是最后一个点。既然是网络流，那么一定不会很简单，每条有向边之间都有一定的权值，称之为容量，用c(i,j)表示，而流过每条路径的称之为流量，用f(i
2017-08-02 20:31:50
848
原创 Codeforces Round #427 (Div. 2) A—D题
传送门：点击打开链接A. Key racestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo boys decided to
2017-08-01 17:02:29
723
数据结构之树状数组讲解
2018-07-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人