know_heng的博客

1519. Formula 1Time limit: 1.0 secondMemory limit: 64 MBBackgroundRegardless of the fact, that Vologda could not get rights to hold the Winter Olympic games of 20**, it is well-known,

描述小Y正在观测y地区的风力情况，他在一条直线上依此设定了n个观测点，并观测与直线垂直方向的风力值，风力有时是正向的也有时是反向的，规定正向时的风力值为正数，他发现每次风力值的变化都可以表示为观测点上一条线段[L,R]上的同时增强或者减弱。小Y希望能够实时统计这些观测点的数据，并且实时分析这些观测点在历史中到达的风力最大绝对值，但是他无法同时对大量的观测点进行分析, 更重要的是他记不住

Post OfficeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19868 Accepted: 10676DescriptionThere is a straight highway with villages alongside the hig

描述最近盛大的一款游戏传奇世界极其火爆。游戏玩家John，想购买游戏中的装备。已知游戏的商店里有n件装备，第i件装备具有属性值ai，购买需要花费bi个金币。John想去购买这些装备，但是账号中只有m个金币，John是个很贪婪的家伙，他想购买尽可能多的装备。并且在保证购买到最多件装备的情况下，他还想让他所购买的装备当中拥有最小属性值的装备的属性值尽可能大。输入输入

#1033 : 交错和时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定一个数 x，设它十进制展从高位到低位上的数位依次是 a0, a1, ..., an - 1，定义交错和函数：f(x) = a0 - a1 + a2 - ... + ( - 1)n - 1an - 1例如：f(3214567) =

LITTLE SHOP OF FLOWERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21394 Accepted: 9895DescriptionYou want to arrange the window of your flower sho

The Battle of ChibiTime Limit: 6000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1598    Accepted Submission(s): 565Problem DescriptionCao Cao

Edge to the RootTime Limit: 1000MS Memory Limit: 131072KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionGiven a tree with n vertices, we want to add an

The story happened long long ago. One day, Cao Cao made a special order called "Chicken Rib" to his army. No one got his point and all became very panic. However, Cao Cao himself felt very proud of hi

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14837 Accepted: 7768DescriptionFarmer John has purchased a lush new rectangular pasture com

Description　　大师兄在取经途中迷上了ACM-ICPC，稍不留神，师傅就被妖怪抓走了。　　大师兄并不着急去救师傅，在虐这道简单题：　　有两个字符串A和B，每一次可以选择以下操作中的一种，只对字符串A进行操作，用最少的操作使得字符串A与字符串B相等：在字符串A中插入一个字符；在字符串A中删除一个字符；将字符串A复制，得到字符串A的一个拷贝

Problem DescriptionMost of us know that in the game called DotA(Defense of the Ancient), Pudge is a strong hero in the first period of the game. When the game goes to end however, Pudge is not a s

Problem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does no

Problem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can ch

Problem DescriptionThere is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.The path between each two different nodes is uni

众所周知，双炮叠叠将是中国象棋中很厉害的一招必杀技。炮吃子时必须隔一个棋子跳吃，即俗称"炮打隔子"。 炮跟炮显然不能在一起打起来，于是rly一天借来了许多许多的炮在棋盘上摆了起来……他想知道，在N×M的矩形方格中摆若干炮（可以不摆）使其互不吃到的情况下方案数有几种。棋子都是相同的。Input一行，两个正整数N和M。NOutput一行，输出方案数mod

Problem DescriptionXiaoji is an OCD (obsessive-compulsive disorder) patient. This morning, his children played with plasticene. They broke the plasticene into N pieces, and put them in a line. Eac

Problem DescriptionAlexandra and her little brother are playing a game called "Clash of Submarines" (COS, for short). In this game, one can build so many(about 100,000) submarines, and detect and

Problem DescriptionYou're given an unlimited number of pebbles to distribute across an N x N game board (N drawn from [3, 15]), where each square on the board contains some positive point value be

DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw o

Problem Description给你一个n*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。 Input包括多个测试实例，每个测试实例包括一个整数n 和n*n个非负数(n Output对于每个测试实例，输出可能取得的

Problem DescriptionNow, a Codefires round is coming to end. ZCC has got C(0≤C≤106) points by solving all problems. He is amazed that all other contestants in his room have also solved the hardes

Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of powe

DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries

PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 62709 Accepted: 21852DescriptionA palindrome is a symmetrical string, that is, a string read

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27600 Accepted: 10693Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），

Number GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3760 Accepted: 1557DescriptionChristine and Matt are playing an exciting game they just inv

此类问题如    石子合并问题 和  玲珑OJ 1066 buy candy   区间DP的典型例题， 状态转移是    dp【i】【j】=min（dp【i】【k】+dp【k+1】【j】+w【i，j】）{ i有一种情况可以优化为O（N^2）的时间复杂度,(1)当函数w[i,j]满足w[i,j]+w[i',j'](2)当函数w[i,j]满足w[i’,j]≤w[i,

Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2156    Accepted Submission(s): 820Problem DescriptionWhen the

扫雷Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 718    Accepted Submission(s): 169Problem Description扫雷游戏是晨晨和小璐特别喜欢的智力游戏，她俩最近沉

To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47559 Accepted: 25161DescriptionGiven a two-dimensional array of positive and negative integer

Bone Collector IITime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4317    Accepted Submission(s): 2249Problem DescriptionThe titl

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

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 93547 Accepted: 35393DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等

Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19224 Accepted: 10706DescriptionIt is well known that a human gene can be considered

GangstersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12559 Accepted: 3556DescriptionN gangsters are going to a restaurant. The i-th gangster comes a

Gone FishingTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 33972 Accepted: 10458DescriptionJohn is going on a fishing trip. He has h hours available (1

题目链接题意：N个数，每次取一个数numi，它的价值等于数列中左边的数 * numi * 右边的数，取完这个数之后，数列重新排列，重复取值，直到取完为止，问取得价值最大和。这道题和取石子问题很像，不同的是取石子问题是合并了一堆，而这里是取走一个值。状态dp【i】【j】表示区间i~j可以取得的最大值，当然第i个数和第j个数是没有取走的。状态转移方程  dp【i】【j】=max

1070 - Generate StringTime Limit：1s Memory Limit：1024MByteSubmissions：106Solved：28DESCRIPTIONMr. Van wants to generate a sequence of characters starting from an empty strin

Bugs Integrated, Inc.Time Limit: 15000MS Memory Limit: 30000KTotal Submissions: 10080 Accepted: 3884Case Time Limit: 5000MSDescriptionBugs Integrated, Inc.