码代码的猿猿

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

C. Dima and Saladtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima, Inna and Seryozha have gathered in a

写法似乎太暴力了。。。B. Maximum Submatrix 2time limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are giv

Number TrianglesConsider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be passed on a route that starts at the top and ends somewhere on th

树形背包。。。。Starship TroopersTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9096    Accepted Submission(s): 2528Problem Descript

经典的树形DP。。。ComputerTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u[Submit]   [Go Back]   [Status]  DescriptionA school bought the

树形DPGodfatherTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit]   [Go Back]   [Status]  DescriptionLast years Chicago was

树形背包。。。Tree of TreeTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionYou're given a

简单的树形背包。。。The more, The BetterTime Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u[Submit]   [Go Back]   [Status]  DescriptionACboy很喜

dp[i][j]记录从当前状态到结束状态的期望。。。dp[i][j]=1+segma( dp[i+a][j+b]*P(a,b) )   a  0..n-i   b  0..n-j递归就可以了，a==0&&b==0的时候要特判一下Back to the PastTime Limit: 2 Seconds      Memory Limit: 65536 KB      Spe

单调队列优化DP ：dp[ i ] [ j ] = max{ dp[ i-1 ] [ j ]  ,  dp[ i - w -1 ] [ k ] - ( j - k )*ap[ i ]  ,  dp [ i - w - 1 ] [ k ] + ( k - j )*bp[ i ]  }后两项 dp [ i - w - 1 ][ k ] + k* xx - j * xx 且 abs( j -

线段树优化DP。。。。Special SubsequenceTime Limit: 5000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionThere a s

恶心的状压DP。。。与炮兵阵地类似。。。多了两个方向。而且发射的炮弹可能被石头挡住。。。。1.因为方向是对称的，所以可以把下面两条边翻上来,考虑这样只要考虑上面的行就行了。。。。2.被石头挡住。。。可以模拟一下3.卡内存。。。。要用滚动数组+把可能的状态存下来StarfruitTime Limit: 4 Seconds      Memory Limit: 

每条边要走的次数刚好的是这条边两端的点数的最小值的两倍。Holiday's AccommodationTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 2116    Accepted Submission(s): 5

数位DP。。。。Count 101Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 912    Accepted Submission(s): 477Problem DescriptionYou

DequeTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2054    Accepted Submission(s): 746Problem DescriptionToday, the teacher ga

装压DP......http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11450J:   You Win!You just  achieved the High  Score on your favorite video game! Now, you get to enter your name! You h

区间DP。。。。Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 2021    Accepted Submission(s): 836Problem Desc

按monitor排序，然后状压DP。。。。D. Cunning Genatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy n

dp[i][j] 表示从第i个人到第j个人的最小花费。。。仅考虑这j-i+1个人，对第i个人而言，如果第i个人第k个出去，那么i+1到i+1+k-1-1个人都在第i个人之前出去了，这里就是一个子问题 dp[i+1][i+1+k-1-1]，i出去要加上(k-1)*D[i]，i+k个人到j个人肯定是在i之后出去的这里是另一个子问题dp[i+k][j]，不过这些人已经等了k个人所以还要加上sum[i

超级简单的数位DP....不要62Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17584    Accepted Submission(s): 5800Problem Description杭

脑子一抽用0初始化DP。。。TLE到爆了。。。。Joke with TurtlesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1203 Accepted: 319 Special JudgeDescriptionTher

水DP。。。GroupsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1133    Accepted Submission(s): 440Problem Description　　After

简单的区间DP。。。BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2518 Accepted: 1300DescriptionWe give the following inductive definition of

按位DP。。。。。Professor TianTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 661    Accepted Submission(s): 360Problem Description

DP预处理出到4个顶点的最大距离,枚举相交的点B. Working outtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSummer is c

这种数据范围一看就想到DP....dp[i][j]:在第i轮有j个不同位置的可能的方法数，配合组合数搞一搞就可以了。。。注意超INTAn Easy GameTime Limit: 2 Seconds      Memory Limit: 65536 KBOne day, Edward and Flandre play a game. Flandre will

很巧妙的单调性......n,n+1,n+2,.....2*n-2   n+1,n+2,.....2*n-2,2*n-1,2*n中间一段是相同的,n和2*n里的1是一样多的所以只有2*n-1不一样.....这是满足单调性的(monotone)然后就是数位DP了.....D. Random Tasktime limit per te

概率DP.....RatingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229    Accepted Submission(s): 140Special JudgeProblem Des

隐马尔可夫模型介绍见这里：点击打开链接Peter's HobbyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 362    Accepted Submission(s): 160Problem De

双调欧几里得 DPTourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3581 Accepted: 1596DescriptionJohn Doe, a skilled pilot, enjoys tra

DP....扫两遍组合起来The Romantic HeroTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 547    Accepted Submission(s): 217Problem Desc

DP....C. Hometasktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSergey attends lessons of the N

预处理出每个数字可以向后延伸多少，然后尝试将两段拼起来。C. DZY Loves Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

数位DP。。。。Palindromic NumbersTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionA palindro

状压DP.....B. Little Pony and Harmony Chesttime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputP

LCS+一维KMP构造转移+记忆化搜索。。。。B. Lucky Common Subsequencetime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outp

DP预处理+枚举逆序对C. Insertion Sorttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya is a beg

N个数到一个数的距离和最小，这个数一定是他们的中位数。dp[i][j]=前i个点，j个office的距离。dp[i][j]=min(dp[k-1][j-1]+w[k][i])    w[k][i]是k..i 修一个office的距离。Post OfficeTime Limit: 1000MS Memory Limi

记忆化搜索dp【还剩下几个】【倒1】【倒2】【倒3】CF JAVA中 public static class 前面好像不能再开类了，连注释掉的类也不可以，好像是个BUG？？？B. Solitairetime limit per test2 secondsmemory limit per test256 megabyte