- 博客(22)
- 收藏
- 关注
转载 hrbust mengxiang000000 题册
原博客---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------1000、【新手】A
2017-05-09 20:58:57 1165
原创 山东省第四届ACM程序设计大赛 Problem A:Rescue The Princess (计算几何)
Problem A:Rescue The PrincessTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 153 Solved: 66[Submit][Status][Discuss]DescriptionSeveral days ago, a beast caught a beautiful princess and the
2017-05-29 16:32:39 308
原创 hrbust 2256 南西群岛海域·冲之岛近海(暴力)
南西群岛海域·冲之岛近海Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 165(63 users)Total Accepted: 59(53 users)Rating: Special Judge: NoDescription
2017-05-18 21:51:52 300
原创 EOJ 3247 铁路修复计划 (最小生成树+二分)
铁路修复计划Time limit per test: 2.0 secondsTime limit all tests: 15.0 secondsMemory limit: 256 megabytes在 A 国有很多城际铁路。这些铁路都连接两个城市(城市从 1 到 n 编号),可以双向通行,使得任意两个城市之间都由铁路网联系起来。不过在一次星球大战之后,所有的
2017-05-18 21:49:31 244
原创 hdu 2089 不要62 (数位dp)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42263 Accepted Submission(s): 15430Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音
2017-05-13 11:05:52 160
原创 hdu 1166 敌兵布阵(线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 88248 Accepted Submission(s): 37176Problem DescriptionC国的死对头A国这段时间正在进行军事演
2017-05-10 13:18:02 160
原创 hrbust 2143 积分大小(dp)
积分大小Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 28(23 users)Total Accepted: 16(16 users)Rating: Special Judge: NoDescription暑期集训开始
2017-05-09 11:50:27 436 4
原创 hust 1366 Game
1366 - GameTime Limit: 1s Memory Limit: 256MBSubmissions: 267 Solved: 16DESCRIPTIONAlice and Bob is playing a game, there N coins in a pile. Alice goes first, she can take away one
2017-05-08 13:03:19 236
原创 Codeforces Round #411 (Div. 2) D. Minimum number of steps
D. Minimum number of stepstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe have a string of letters 'a' a
2017-05-05 12:40:26 328
原创 hrbust 1079 I can do it(贪心)
I can do itTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 254(115 users)Total Accepted: 123(94 users)Rating: Special Judge: NoDescription
2017-05-04 10:36:30 231
原创 hrbust 1584 青蛙过河(二分)
青蛙过河Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 68(38 users)Total Accepted: 36(32 users)Rating: Special Judge: NoDescription青蛙王国一年
2017-05-03 12:29:49 337
原创 hrbust 2203 Alice and Bob(规律 博弈)
Alice and BobTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 19(11 users)Total Accepted: 12(10 users)Rating: Special Judge: NoDescription
2017-05-02 23:53:30 363
原创 hrbust 1526 小猴和冒泡()
小猴和冒泡Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 206(66 users)Total Accepted: 72(47 users)Rating: Special Judge: NoDescription
2017-05-02 23:24:45 321
原创 hrbust 2028 小猴和冒泡2 (逆序数)
Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 217(57 users)Total Accepted: 43(35 users)Rating: Special Judge: NoDescription小猴和冒泡问题已经成了一个历史问题,因为很多年
2017-05-02 23:18:35 351
原创 hrbust 2086 奔跑的xiaodao(二分)
奔跑的xiaodaoTime Limit: 4000 MSMemory Limit: 65536 KTotal Submit: 430(32 users)Total Accepted: 117(24 users)Rating: Special Judge: YesDescription
2017-05-01 21:45:02 267
原创 HRBUST 2219 Recover the Matrix(水题)
Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 2(2 users)Total Accepted: 1(1 users)Rating: Special Judge: NoDescriptionGiven two n * m matrix a con
2017-05-01 20:07:23 227
原创 HRBUST 1855 幼稚园的矩阵(矩阵快速幂)
幼稚园的矩阵Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 21(8 users)Total Accepted: 11(6 users)Rating: Special Judge: NoDescription Ko
2017-05-01 19:55:09 293
原创 FZU - 2221 RunningMan
ZB loves watching RunningMan! There's a game in RunningMan called 100 vs 100.There are two teams, each of many people. There are 3 rounds of fighting, in each round the two teams send some people to
2017-05-01 11:18:16 271
原创 FZU - 2216 The Longest Straight (单调)
E - The Longest Straight FZU - 2216 单调队列维护前缀 时间复杂度是O(m+m)时间大约是200ms桶处理数据判断每一个位置从0 到当前位置全部连城顺子需要补足几个然后维护两个变量 l和r从1 开始走都走到 mres=max(r-l,res);
2017-05-01 11:06:21 221
原创 FZU - 2214 Knapsack problem (dp(对价值dp))
Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less than or equal to a given limit B and the total va
2017-05-01 11:00:33 258
原创 FZU - 2213 Common Tangents(几何)
Two different circles can have at most four common tangents.The picture below is an illustration of two circles with four common tangents.Now given the center and radius of two circles, your
2017-05-01 10:53:56 230
原创 FZU - 2212 Super Mobile Charger
While HIT ACM Group finished their contest in Shanghai and is heading back Harbin, their train was delayed due to the heavy snow. Their mobile phones are all running out of battery very quick. Luckily
2017-05-01 10:52:00 211
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人