算法竞赛 - 随笔分类(第8页) - 超级学渣渣

Painting Fence

摘要：Painting Fence Time Limit:1000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Submit Status Painting Fence Submit Status Description Bizon the 阅读全文

posted @ 2016-07-21 20:20 超级学渣渣阅读(469) 评论(0) 推荐(0)

cf #363 d

摘要：time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit per test 2 seconds time limit 阅读全文

posted @ 2016-07-21 09:53 超级学渣渣阅读(273) 评论(0) 推荐(0)

cf #363 c

摘要：C. Vacations time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasya has n days of vacation 阅读全文

posted @ 2016-07-21 09:51 超级学渣渣阅读(168) 评论(0) 推荐(0)

cf #363 b

摘要：B. One Bomb time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. One Bomb time limit per te 阅读全文

posted @ 2016-07-21 09:49 超级学渣渣阅读(191) 评论(0) 推荐(0)

cf #363 a

摘要：A. Launch of C time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There will be a launch of 阅读全文

posted @ 2016-07-21 09:47 超级学渣渣阅读(307) 评论(0) 推荐(0)

codeforces #363a Launch of Collider

摘要：A. Launch of Collider time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Launch of Colli 阅读全文

posted @ 2016-07-20 10:34 超级学渣渣阅读(215) 评论(0) 推荐(0)

codeforces624b Making a String

摘要：Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Submit Status Description You are given an alphabet consisting of 阅读全文

posted @ 2016-07-19 20:52 超级学渣渣阅读(189) 评论(0) 推荐(0)

codeforces 651a oysticks

摘要：Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Submit Status Description Friends are going to play console. They 阅读全文

posted @ 2016-07-19 20:34 超级学渣渣阅读(172) 评论(0) 推荐(0)

uva 11729 Commando War

摘要：B - Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status B - Submit Status Description 或许每个人都有成为将军的梦想，小光也是如此。从小，小光就立志长大了以后要做一名阅读全文

posted @ 2016-07-19 20:13 超级学渣渣阅读(255) 评论(0) 推荐(0)

hdu 5720 Wool

摘要：1003 Wool Provider : frank_c1 考虑三角形三条边a,b,ca,b,c (a \ge b)(a≥b)的关系a - b < c, a + b > ca−b<c,a+b>c，即c \in (a-b,a+b)c∈(a−b,a+b)。令加入的边为cc，枚举所有边作为aa的情况。对阅读全文

posted @ 2016-07-18 21:03 超级学渣渣阅读(150) 评论(0) 推荐(0)

hdu5719 Arrange

摘要：首先，根据题意可得B数组应是单调不升的，C数组是单调不降的。可以发现A_1 = B_1 = C_1A1=B1=C1，所以如果B_1 \neq C_1B1≠C1无解。进一步，我们发现如果B_i < B_{i-1}Bi<Bi−1，A_i = B_iAi 阅读全文

posted @ 2016-07-18 15:02 超级学渣渣阅读(188) 评论(0) 推荐(0)

7-16 Bestcoder a Oracle

摘要：Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 325 Accepted Submission(s): 139 Problem Descrip 阅读全文

posted @ 2016-07-18 10:05 超级学渣渣阅读(238) 评论(0) 推荐(0)

codeforces 573b Bear and Blocks

摘要：http://www.aichengxu.com/view/1753982 据这个大神说，这是一道dp题，但是我暂时还不理解。什么时候可以dp，如何dp？先记录下来再说了。 Bear and Blocks Time Limit:1000MS Memory Limit:262144KB 64bit 阅读全文

posted @ 2016-07-17 18:22 超级学渣渣阅读(699) 评论(0) 推荐(0)

行尸走肉

一个小程序员的成长历程

随笔分类 - 算法竞赛

公告