原创 【2017瀋陽網絡賽】1003 hdu6196 happy happy happy 暴搜+區間dp+卡時優化
Problem Description Today, Bob plays with a child. There is a row of n numbers. One can takes a number from the lef
原创 2017 ACM/ICPC Asia Regional Qingdao Online 1007 hdu 6212 Zuma 區間dp
Problem Description Think about the Zuma Game. You have a row of at most 200 black(0) or white(1) balls on the tabl
原创 【2017瀋陽網絡賽】1012 hdu6205 card card card 貪心
Problem Description As a fan of Doudizhu, WYJ likes collecting playing cards very much. One day, MJF takes a stack
原创 【2017廣西邀請賽】hdu 6184 Counting Stars 三元環+set
Problem Description Little A is an astronomy lover, and he has found that the sky was so beautiful! So he is countin
原创 【2017廣西邀請賽】hdu 6186 CS Course
Problem Description Little A has come to college and majored in Computer and Science. Today he has learned bit-opera
原创 hdu 4799 LIKE vs CANDLE. 樹形dp
Problem Description A microblog caused a war recently - There's the war between LIKE and CANDLE. As you see, there
原创 【2017瀋陽網絡賽】1006 hdu6199 gems gems gems 動態規劃
Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a game with these n g
原创 【2017廣西邀請賽】hdu 6188 Duizi and Shunzi 貪心
Problem Description Nike likes playing cards and makes a problem of it. Now give you n integers, ai(1≤i≤n) We define
原创 【2017廣西邀請賽】hdu 6182 A Math Problem
Problem Description You are given a positive integer n, please count how many positive integers k satisfy kk≤n.
原创 【2017新疆網絡賽】A Banana
Bananas are the favoured food of monkeys. In the forest, there is a Banana Company that provides bananas from differe
原创 【2017新疆網絡賽】C Coconut
Coconut is Captain Gangplank's favourite fruit. That is why he needs to drink coconut juice from bbcoconuts each day
原创 【2017新疆網絡賽】E Half-consecutive Numbers 打表
The numbers 11, 33, 66, 1010, 1515, 2121, 2828, 3636, 4545 and ti=12i(i+1)ti=21i(i+1), are called half-conse
原创 【2013南京現場賽】1003 hdu4804 Campus Design 插頭dp
Problem Description Nanjing University of Science and Technology is celebrating its 60th anniversary. In order to ma
原创 zoj 3732 Graph Reconstruction 構造
Let there be a simple graph with N vertices but we just know the degree of each vertex. Is it possible to reconstruct
原创 【2013南京現場賽】1001 hdu4802 GPA
Problem Description In college, a student may take several courses. for each course i, he earns a certain credit (ci