随笔分类 - Codeforces

Codeforces Round #323 (Div. 2) D. Once Again... 暴力+最长非递减子序列

摘要：D. Once Again...You are given an array of positive integersa1, a2, ..., an × Tof lengthn × T. We know that for ... 阅读全文

posted @ 2015-10-05 17:25 meekyan 阅读(480) 评论(0) 推荐(0)

Codeforces Round #323 (Div. 2) C. GCD Table 暴力

摘要：C. GCD Tabletime limit per test2 secondsThe GCD tableGof sizen × nfor an array of positive integersaof lengthnis defined by fo... 阅读全文

posted @ 2015-10-04 23:03 meekyan 阅读(208) 评论(0) 推荐(0)

Codeforces Round #322 (Div. 2) D. Three Logos 模拟

摘要：D. Three LogosThree companies decided to order a billboard with pictures of their logos. A billboard is a bigsquareboard. A l... 阅读全文

posted @ 2015-10-01 00:07 meekyan 阅读(240) 评论(0) 推荐(0)

Codeforces Round #233 (Div. 2)D. Painting The Wall 概率DP

摘要：D. Painting The WallUser ainta decided to paint a wall. The wall consists ofn2tiles, that are arranged in ann ×... 阅读全文

posted @ 2015-09-29 14:35 meekyan 阅读(318) 评论(0) 推荐(0)

Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] D "Or" Game 枚举+前缀后缀

摘要：D. "Or" Game time limit per test 2 se... 阅读全文

posted @ 2015-09-17 13:19 meekyan 阅读(175) 评论(0) 推荐(0)

Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] C C Problem about Polyline 数学

摘要：C. A Problem about Polyline time limit per test ... 阅读全文

posted @ 2015-09-17 13:14 meekyan 阅读(161) 评论(0) 推荐(0)

Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] B. Finding Team Member 排序

摘要：B. Finding Team Member time limit per test ... 阅读全文

posted @ 2015-09-17 12:37 meekyan 阅读(225) 评论(0) 推荐(0)

Codeforces Round #240 (Div. 1) B. Mashmokh and ACM DP

摘要：B. Mashmokh and ACM time limit per test ... 阅读全文

posted @ 2015-09-11 22:50 meekyan 阅读(226) 评论(0) 推荐(0)

Codeforces Round #319 (Div. 2)B. Modulo Sum DP

摘要：B. Modulo Sum time limit per test ... 阅读全文

posted @ 2015-09-11 16:16 meekyan 阅读(290) 评论(0) 推荐(0)

Codeforces Round #319 (Div. 2) C. Vasya and Petya's Game 数学题

摘要：C. Vasya and Petya's Game time limit per test ... 阅读全文

posted @ 2015-09-11 15:25 meekyan 阅读(295) 评论(0) 推荐(0)

Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) A. Bear and Elections 优先队列

摘要：A. Bear and Elections time limit per test1... 阅读全文

posted @ 2015-08-30 10:43 meekyan 阅读(266) 评论(0) 推荐(0)

Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) B. Bear and Three Musketeers 枚举

摘要：B. Bear and Three Musketeers time limit per test2 seconds ... 阅读全文

posted @ 2015-08-30 10:40 meekyan 阅读(164) 评论(0) 推荐(0)

Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)C. Bear and Poker

摘要：C. Bear and Poker time limit per test2 seconds memory limit per t... 阅读全文

posted @ 2015-08-30 10:25 meekyan 阅读(188) 评论(0) 推荐(0)

Codeforces Round #267 (Div. 2) C. George and Job DP

摘要：C. George and JobThe new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have... 阅读全文

posted @ 2015-08-23 19:22 meekyan 阅读(257) 评论(0) 推荐(0)

codeforces Round #263(div2) D. Appleman and Tree 树形dp

摘要：题意：给出一棵树，每个节点都被标记了黑或白色，要求把这棵树的其中k条变切换，划分成k+1棵子树，每颗子树必须有1个黑色节点，求有多少种划分方法。题解：树形dpdp[x][0]表示是以x为根的树形成一块不含黑色点的方案数dp[x][1]表示是以x为根的树形成一块含一个黑色点方案数//зїеп:1085... 阅读全文

posted @ 2015-08-23 18:15 meekyan 阅读(384) 评论(0) 推荐(0)

POJ2735/Gym 100650E Reliable Nets dfs

摘要：Problem E: Reliable NetsYou’re in charge of designing a campus network between buildings and are very worried about itsreliability and its cost. So, y... 阅读全文

posted @ 2015-08-19 00:33 meekyan 阅读(398) 评论(0) 推荐(0)

Gym 100650H Two Ends DFS+记忆化搜索

摘要：Problem H: Two EndsIn the two-player game “Two Ends”, an even number of cards is laid out in a row. On each card, faceup, is written a positive intege... 阅读全文

posted @ 2015-08-18 20:22 meekyan 阅读(320) 评论(0) 推荐(0)

Codeforces Gym 100203G G - Good elements 标记暴力

摘要：G -Good elementsTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87954#problem/GDescriptionYou are give... 阅读全文

posted @ 2015-08-16 00:15 meekyan 阅读(179) 评论(0) 推荐(0)

Codeforces Gym 100203I I - I WIN 网络流最大流

摘要：I -I WINTime Limit: 2 SecMemory Limit: 256 MB题目连接http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87954#problem/IDescriptionGiven ann × mrectangu... 阅读全文

posted @ 2015-08-15 23:51 meekyan 阅读(331) 评论(0) 推荐(0)

Codeforces Codeforces Round #316 (Div. 2) C. Replacement set

摘要：C. ReplacementTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/570/problem/CDescriptionDaniel has a strings, consisting of lowe... 阅读全文

posted @ 2015-08-14 10:08 meekyan 阅读(232) 评论(0) 推荐(0)