dream

摘要： DescriptionGive you a sequence of n numbers, and a number k you should find the max length of Good subsequence. Good subsequence is a continuous subse... 阅读全文

摘要： 题意：你有X元钱，进行M轮赌博游戏。每一轮可以将所持的任意一部分钱作为赌注（赌注为0元表示这一轮不押），赌注可以是小数的，不是一定要整数。每一轮 赢的概率为P，赢了赌注翻倍，输了赌注就没了。如果你最后持有至少1000000元钱的话，就可以把钱全部带走。要求计算在采取最优策略时，获得至少 100000... 阅读全文

摘要： C. Ilya and Stickstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the evening, after the cont... 阅读全文

摘要： ROADSTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11265Accepted: 4172DescriptionN cities named with numbers 1 ... N are connected with one... 阅读全文

摘要： MosaicTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 904Accepted Submission(s): 394Problem Des... 阅读全文

摘要： Apple TreeTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20335Accepted: 6182DescriptionThere is an apple tree outside of kaka's house. Every... 阅读全文

摘要： Problem F: Frequent valuesYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given severa... 阅读全文

摘要： Problem KK Smallest SumsYou're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate th... 阅读全文

摘要： Problem F: Fabled RooksWe would like to placenrooks, 1≤n≤5000, on an×nboard subject to the following restrictionsThei-th rook can only be placed withi... 阅读全文

摘要： K - 4 Values whose Sum is 0Crawling in process... Crawling failed Time Limit:9000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice... 阅读全文