- 博客(150)
- 资源 (8)
- 收藏
- 关注
原创 Linux 下 Sublime3 编译运行Java
{ "cmd": ["javac", "-Xlint", "$file"], "file_regex": "^(...*?):([0-9]*):?([0-9]*)", "working_dir": "${file_path}", "selector": "source.java", "variants": [ {
2014-11-30 23:51:14 1968
原创 HDOJ 5115 Dire Wolf 区间DP
区间DPDire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 44 Accepted Submission(s): 30Problem DescriptionDire w
2014-11-30 00:37:45 1791
原创 HDOJ 5112 A Curious Matt 水题
A Curious MattTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 64 Accepted Submission(s): 49Problem DescriptionThere is a cu
2014-11-29 23:55:09 812
原创 HDOJ 5122 K.Bro Sorting 水题
K.Bro SortingTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 71 Accepted Submission(s): 40Problem DescriptionMatt’s friend
2014-11-29 23:54:07 958
原创 HDOJ 5119 Happy Matt Friends DP
N*M暴力DP....Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 82 Accepted Submission(s): 34Problem Descrip
2014-11-29 23:52:34 1521
原创 HDOJ 5120 Intersection 两圆面积交
两圆面积交....IntersectionTime Limit: 4000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 101 Accepted Submission(s): 38Problem Description
2014-11-29 23:50:09 1070
原创 POJ 2546 & ZOJ 1597 Circular Area 两圆的面积交
Circular AreaTime Limit: 2 Seconds Memory Limit: 65536 KBYour task is to write a program, which, given two circles, calculates the area of their intersection with the accuracy of three
2014-11-29 22:34:43 937
原创 Codeforces 383D. Antimatter DP
D. Antimattertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub accidentally discovered a secret lab. He
2014-11-27 19:31:13 1176
原创 Codeforces 383B. Volcanoes 模拟
记录每一层可以移动到的区间....非常多的细节...B. Volcanoestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub
2014-11-27 11:34:57 1464
原创 Codeforce 383C. Propagating tree
C. Propagating treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub likes trees very much. Recently h
2014-11-26 11:55:50 1217
原创 Codeforces Round #277.5 (Div. 2) JAVA版题解
Codeforces Round #277.5 (Div. 2)A. SwapSorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output
2014-11-25 00:38:58 2138
原创 POJ 3621 Sightseeing Cows 最大密度环 01分数规划
最大密度环 01分数规划 首先的一个结论就是,不会存在环套环的问题,即最优的方案一定是一个单独的环,而不是大环套着小环的形式。这个的证明其实非常的简单,大家可以自己想一下(提示,将大环上的收益和记为x1,花费为y1,小环上的为x2,y2。重叠部分的花费为S。表示出来分类讨论即可)。有了这个结论,我们就可以将花费和收益都转移到边上来了,因为答案最终一定是一个环,所以我们将每一条边
2014-11-24 16:02:06 1097
原创 POJ 2728 Desert King 最优比例生成树
最优比例生成树,迭代方法.....Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 21086 Accepted: 5916DescriptionDavid the Great has just
2014-11-24 14:04:40 959
原创 POJ 2976/ZOJ 3068 Dropping tests 01分数规划
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6464 Accepted: 2230DescriptionIn a certain course, you take n tests. If you get ai out o
2014-11-24 09:57:24 1217
原创 UVA 1637 Double Patience 概率DP
Double PatienceTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionDouble Patience is a single player game played wit
2014-11-23 23:24:40 1260
原创 HDOJ 4669 Mutiples on a circle
/*题意:给出一个环,每个点是一个数字,取一个子串,使得拼接起来的数字是K的倍数。由于K不大,暂且不考虑环的话,那么dp[i][j]表示以i结尾的,模K为j的有多少个子串。那么sigma (dp[i][0])便是不考虑环的答案。考虑环的话,不知道别人怎么写的,我感觉我的写法不是很复杂。环和情况1 和n肯定是必选的,那么便是一个前缀为后缀,一个后缀为前缀拼接而成。所以枚举某个前缀
2014-11-23 15:34:17 922
原创 HDOJ 4671 Backup Plan 构造优先队列
优先队列构造前两列....Backup PlanTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 775 Accepted Submission(s): 365Special JudgeProblem
2014-11-22 23:47:58 999
原创 HDOJ 4666 Hyperspace 最大曼哈顿距离
二进制转化,求最大曼哈顿距离....HyperspaceTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1123 Accepted Submission(s): 530Problem D
2014-11-22 23:45:28 1147
原创 UVA 11181 Probability|Given 概率
Probability|GivenTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem GProbability|GivenInput: Standard InputOutpu
2014-11-19 14:24:25 1222
原创 UVA 10491 Cows and Cars 概率
Cows and CarsTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem HCows and CarsInput: standard inputOutput: stand
2014-11-19 13:17:28 882
原创 UVA 1636 Headshot 概率
HeadshotTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionYou have a revolver gun with a cylinder that has n chambe
2014-11-19 12:56:46 1112
原创 UVA 10820 Send a Table euler_phi函数
除1,1外其他的x,y都不相等对于 xF[x]= phi(i) 2结果为 2*F[x]+1Problem ASend a TableInput: Standard InputOutput: Standard Output When participating in programming contests, you sometimes face the fo
2014-11-19 10:57:04 1193
原创 POJ 2167 Irrelevant Elements 质因数分解
Irrelevant ElementsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2231 Accepted: 550Case Time Limit: 2000MSDescriptionYoung cryptoanalyst Georgie
2014-11-19 09:43:05 999
原创 HDOJ 4745 Two Rabbits DP
Two RabbitsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 944 Accepted Submission(s): 496Problem DescriptionLong long ago,
2014-11-18 20:42:03 789
原创 2014 ACM Beijing Regional
比的很顺利,除了A题忘了加Case WA 了一发外,其他5题全部1Y,飘逸的不行~~~放飞的气球.....飘了一会又掉下来被人捡走了.......今年的第一场Regional.....现场走势.....最后感谢 波大大 的大力支持,每次到北京都请客.....
2014-11-17 14:39:53 1318
原创 Codeforces Round #277 (Div. 2) 题解
Codeforces Round #277 (Div. 2)A. Calculating Functiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outp
2014-11-13 12:29:49 1794
原创 HDOJ 2196 Computer 树的直径
由树的直径定义可得,树上任意一点到树的直径上的两个端点之一的距离是最长的...三遍BFS求树的直径并预处理距离.......ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3522 Acce
2014-11-11 19:48:58 799
原创 UVA 1025 A Spy in the Metro DP
DP[ i ][ j ] 在 i 时刻 j 号车站的等待最小时间.....有3种可能: 在原地等,坐开往左边的车,做开往右边的车A Spy in the MetroTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluS
2014-11-11 00:52:39 2857
原创 UVA 12716 GCD XOR
12716 GCD XORGiven an integer N, find how many pairs (A, B) are there such that: gcd(A, B) = A xor B where1 ≤ B ≤ A ≤ N.Here gcd(A, B) means the greatest common divisor of the numbers A and B. A
2014-11-10 15:50:03 1132
原创 UVA10791 Minimum Sum LCM 质因数分解
Minimum Sum LCMTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Minimum Sum LCM LCM (L
2014-11-10 13:40:45 825
原创 UVA10375 Choose and divide 质因数分解
质因数分解:Choose and divideTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem D: Choose and
2014-11-10 11:22:32 1000
原创 HDOJ 2769 Disgruntled Judge 扩展GCD
扩展GCD:枚举a,扩展GCD求b,再暴力检查Disgruntled JudgeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 329 Accepted Submission(s): 142Pr
2014-11-09 23:20:15 1075
原创 UVA 11582 Colossal Fibonacci Numbers! 数学
n比较小,最多n*n就回出现循环节....Colossal Fibonacci Numbers!Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription
2014-11-09 10:48:45 1402
原创 Codeforces 483B. Friends and Presents 二分查找
二分查找:B. Friends and Presentstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have two
2014-11-08 22:52:46 849
原创 Codeforces 482B. Interesting Array 线段树
B. Interesting Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe'll call an array of n non-negative i
2014-11-08 10:57:49 1173
原创 ZOJ 3904 Beer Problem 最大费用最大流
最大费用最大流,当费用为负时直接退出Beer ProblemTime Limit: 2 Seconds Memory Limit: 32768 KBEveryone knows that World Finals of ACM ICPC 2004 were held in Prague. Besides its greatest architectur
2014-11-07 23:51:23 954
原创 Codeforces 484A. Bits 贪心
A. Bitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's denote as the number of bits set ('1' bits)
2014-11-07 18:41:06 1276
原创 Codeforces 485 A. Factory 暴力
乱暴力就可以了....A. Factorytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne industrial factory
2014-11-07 15:55:09 1308
原创 Codeforces 479D. Long Jumps 暴力
答案只有0,1,2三种情况,暴力判断D. Long Jumpstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValery is a
2014-11-07 14:37:10 860
原创 Codeforces 497C. Exams 贪心
C. Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Valera is an undergraduate student at the U
2014-11-07 13:36:00 909
ManicTime Professional v2.5.2.1 简体中文破解版
2014-05-01
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人