say_c_box的博客

Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28869    Accepted Submission(s): 10125Problem DescriptionNow I

Josephina and RPGTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1538    Accepted Submission(s): 467Special JudgeProblem Description

BombTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 15805    Accepted Submission(s): 5761Problem DescriptionThe counter-terrori

不要62Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 35612    Accepted Submission(s): 12972Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音

A. Arpa’s hard exam and Mehrdad’s naive cheattime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere exists a

原题：https://odzkskevi.qnssl.com/efe310c5868f7c1881a7cec2c6b3e9cc?v=1487513501You are following a recipe to create your lunch.The recipe is a mixture made by combining ingredients togetherin a bow

A decorative fenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7545 Accepted: 2869DescriptionRichard just finished building his new house. Now the

温泉旅店Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 262143/262143KB (Java/Others)Submit Status天空飘下一朵一朵的雪花，这是一片纯白的世界。在天空之下的温泉旅店里，雪菜已醉倒在一旁，冬马与春希看了看说着梦话的雪菜，决定找一点玩的来度过这愉快的晚

There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one is located in th

E. Wet Shark and Blockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are b blocks of digits. Each

PermutationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 910    Accepted Submission(s): 536Problem DescriptionThere is an arra

A. Functions againtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomething happened in Uzhlyandia again...

题目链接：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1943白书P209// test.cpp : 定义控制台应用程序的入口点。//#define _CRT_SECURE_NO_WARNINGS#include

题目传送门：http://codeforces.com/gym/100269/attachments/download/1978/20132014-acmicpc-neerc-nothern-subregional-contest-en.pdfdp[i][j]表示i为最后一个分段的结尾，一共分了j端。详细的解释可以看这篇博客，想到预处理正序对就很简单了。http://blog.

E. Selling Souvenirstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter several latest reforms many tour

C. Vladik and Memorable Triptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladik often travels by trains

Pick The SticksTime Limit: 15000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1336    Accepted Submission(s): 443Problem DescriptionThe story

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 52488 Accepted: 21709DescriptionA subsequence of a given sequence is the given seque

Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11553 Accepted: 3790Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低

B. Sagheer, the Hausmeistertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSome people leave the lights at

代码均未经过严格测试，仅供参考最优二叉查找树动态规划原理动态规划与分治法相似，都是通过组合子问题的解来求解原问题。动态规划通常是用来求解最优化问题（optimization problem）.这类问题可以有很多个可行解，每个解都有一个值，我们希望寻找最优值（最大值或者最小值）的解。我们称这样的解为问题的一个最优解（oneoptimization solution）而不是最优解（theoptimiz

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15100    Accepted Submission(s): 7997Problem DescriptionA group

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9323    Accepted Submission(s): 4405Problem DescriptionIgnatius ha

http://codeforces.com/gym/101190/attachments题目大意：有n张卡片，每一张卡片有一个初始摆放方式，w代表错误方式，c代表正确方式。每次随意选出最上方的k张卡片，观察第一张，如果第一张错误摆放，则将这k张全部翻转，这k张就不再管了，知道卡片堆为空为止。问最后错误摆放的牌的个数的期望。 题解：我们从后往前考虑，dp[i]表示剩余卡片为i-n的情况下，考虑怎么转

PermutationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 896    Accepted Submission(s): 281Problem Descriptionbobo has a per

E. Karen and Supermarkettime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputOn the way home, Karen decided to

Colorful TreeTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1152    Accepted Submission(s): 463Problem DescriptionThere is a

Wavel SequenceTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 728    Accepted Submission(s): 377Problem DescriptionHave you ev

Find a pathTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1866    Accepted Submission(s): 809Problem DescriptionFrog fell into

/*知道之后n天的股票买卖价格（api，bpi），以及每天股票买卖数量上限（asi，bsi），问他最多能赚多少钱。开始时有无限本金，要求任两次交易需要间隔W天以上，即第i天交易，第i+w+1天才能再交易。同时他任意时刻最多只能拥有maxp的股票，容易写出DP方程 dp[i][j]=max{dp[i-1][j],max{dp[r][k]-APi[i]*(j-k)}(0j)} 分别是第i天不交易

FenceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5185 Accepted: 1643DescriptionA team of k (1 <= K <= 100) workers should paint a fence which contai

当元素比较少的时候，并且和集合状态有关的问题是，就可以考虑用一个二进制的整数来表示集合。整数的每一位上，若为0则表示对应的元素不选取，若为1则表示对应的元素选取。以此为基础可以进行一些简单的集合运算。空集：0     只含有第i个元素的集合：1含有从0开始的n个元素的集合:  1判断第i个元素是否属于集合S：if(S>>i&1)向集合中加入第i个元素：S|(1向集合中删

题目如下：DescriptionPirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that i

D - VacationsTime Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionVasya has n days of vacations! So he decided to improve his IT s

Anniversary partyTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is going to be a party to celebrate the 80-th Anniversa

题目：P个并排的牢房（1，2，3....P）。每个牢房一个囚犯。现在要释放其中的Q个囚犯。每释放一个囚犯，就得向左给每一个相邻囚犯一枚金币，直到遇到空牢房。向右也是如此。问以什么样的顺序释放所花费的金币最少？#include #include #include #include #include #include #include #include #include usin

Mondriaan's DreamTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 15207Accepted: 8771DescriptionSquares and rectangles fascinated the famous Dutch pai

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1576题意：就是求两个序列的最长公共子序列思路：因为数据量是10^5的，一般的n^2的算法会TML。所以得优化，就是把a中出现的数，在b中出现过的对应的位置记录下来，然后用nlgn的

La Vie en roseTime Limit: 7000/3500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2329    Accepted Submission(s): 706Problem DescriptionProfessor Zh

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6335 Accepted: 3388DescriptionWe give the following inductive definition of a “regular brack