jerans的博客

B. School Markstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vova studies programming in an elite

https://www.qduoj.com/problem/6/题意是给两个字符串s,t，每次操作是在s的某个字符c后面添加一个字符d，但要求d！=c，问能不能经过某些操作后使构造出t串贪心几个感觉比较好的样例aaabaaaaabaNoaaabaaaabbbaYesbaabaaYesabbabbYescatca

http://acm.split.hdu.edu.cn/showproblem.php?pid=4803题意是两个数，x，y，x指个数，y指价值总和，两种操作，操作1：x+1（个数加一，总和在加一个单价，也就是y+=y/x），操作2：y+1（总和加一,个数不变，其实也相当于单价变高），问你从x=1，y=1开始，到达给的某个x1，y1，最少需要几步操作可以去向单价方面考虑，既然要到达x1

http://poj.org/problem?id=3262题意：n头牛在吃草，每秒吃di，你要驱赶这些牛，驱赶的时间2*ti，求怎么赶走全部牛，使总共吃最少的草（牛从你开始赶它就不在吃草看了题解才会。。。。。设已经x时刻两头牛，判断是否要交换赶牛的顺序di，tidj，tj先第i头在第j头吃的草：x*di+（x+2*ti）*dj先第j头在第i头吃的草：x

B. The Queuetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFinally! Vasya have come of age and that means

A题类似想到给多个区间，求最少多少个区间可以覆盖全部的问题，求法就是从当前这步能够到达的区间里，选一个下一步能到的最大值，对于本题，区别一是树形结构，不是一维的直线了，区别二是点都是连续的，不是离散的了，所以就可以把求法转化成记录，树形遍历，记录当前步这个范围里下一步能走的最大值。详见代码举两个样例方便理解input512321 2 3 2 1output

D. The Union of k-Segmentstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n segments on the

C. Mike and gcd problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a sequence A = [a1, a2, ..

DetachmentTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 895    Accepted Submission(s): 258Problem DescriptionIn a highly devel

D. Free Markettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJohn Doe has recently found a "Free Market" i

F. Bishops Alliancetime limit per test9 secondsmemory limit per test256 megabytesinputbishops.inoutputstandard outputChessforces is coming into a great war. The

C. Dasha and Passwordtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter overcoming the stairs Dasha cam

C - 翻纸牌游戏Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2209Description有一种纸牌游戏，很有意思，给你N张纸牌，一字排开，纸牌有正反两面，开始的纸牌可能是一种乱的状态（有

Reorder the BooksTime Li: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1428    Accepted Submission(s): 752Problem Descriptiondxy has a

Keep On MovinTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1016    Accepted Submission(s): 716Problem DescriptionProfessor Zha

C. Alyona and mextime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlyona's mother wants to present an array

C. Anton and Making Potionstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is playing a very interes

D. Cartons of milktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOlya likes milk very much. She drinks k 

http://codeforces.com/contest/794/problem/C题意：两个人每个人有一个长度n的字符集合，构造一个长度为n的字符串A是希望字符串字典序越小越好，B希望字符串字典序越大越好贪心，首先可以明确A，B都有一个必选集合，A要选（n+1）/2个，必会选自己有的最小的前几个，B必选自己有的最大的前几个如果A当前能选的最小的小于B当前能选的最大的，那么必定是