ACM__codeforces
文章平均质量分 83
wust_zwl
学不死,就往死里学。
展开
-
codeforces 384C Milking cows(脑洞+思维)
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the cows that see th原创 2017-07-31 09:16:21 · 410 阅读 · 0 评论 -
Codeforces 8C Looking for Order(状态压缩DP)
Girl Lena likes it when everything is in order, and looks for order everywhere. Once she was getting ready for the University and noticed that the room was in a mess — all the objects from her handbag were thrown about the room. Of course, she wanted to pu原创 2017-07-31 19:49:52 · 411 阅读 · 0 评论 -
codeforces 340D Bubble Sort Graph(dp+二分)
Iahub recently has learned Bubble Sort, an algorithm that is used to sort a permutation with n elements a1, a2, ..., an in ascending order. He is bored of this so simple algorithm, so he invents his own graph. The graph (let's call it G) initially has n ve原创 2017-07-24 10:18:18 · 387 阅读 · 0 评论 -
CF 149D Coloring Brackets(区间DP,好题,给配对的括号上色,求上色方案数,限制条件多,dp四维)
Once Petya read a problem about a bracket sequence. He gave it much thought but didn't find a solution. Today you will face it.You are given string s. It represents a correct bracket sequence. A correct bracket sequence is the sequence of opening ("(") a转载 2017-07-15 15:58:34 · 523 阅读 · 0 评论 -
codeforces 788A Functions again(dp之最大子段和)【模板】
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximu原创 2017-08-02 16:15:02 · 322 阅读 · 0 评论 -
codeforces 777C Alyona and Spreadsheet(DP+思维)
During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.Now she has a table filled with integers. The table consists of n rows and m columns. By ai, j we will denote the integer located at the原创 2017-08-02 20:07:54 · 444 阅读 · 0 评论 -
POJ 3356 (最长公共子序列)
Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below:Deletion: a letter in x is missing in y at a corresponding position.Insertion: a letter in y is missing in x at a correspond原创 2017-07-25 16:24:00 · 309 阅读 · 0 评论