__小明003的博客

数塔Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26527    Accepted Submission(s): 15970Problem Description在讲述DP算法的时候，一个经典的例

Euro EfficiencyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3712 Accepted: 1582DescriptionOn January 1st 2002, The Netherlands, and several other Eur

DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 66477 Accepted: 17291DescriptionMarsha and Bill own a collection of marbles. They want to split

CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 33224 Accepted: 11279DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...

The Fewest CoinsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6030 Accepted: 1807DescriptionFarmer John has gone to town to buy some farm supplies. Be

Anniversary partyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8730    Accepted Submission(s): 3772Problem DescriptionTher

ComputerTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5508    Accepted Submission(s): 2748Problem DescriptionA school boug

Information DisturbingTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2540    Accepted Submission(s): 901Problem Description

GodfatherTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5860 Accepted: 2052DescriptionLast years Chicago was full of gangster fights and strange murd

Tree CuttingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4316 Accepted: 2627DescriptionAfter Farmer John realized that Bessie had installed a "tree-s

Contestants DivisionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9349 Accepted: 2676DescriptionIn the new ACM-ICPC Regional Contest, a special moni

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11953 Accepted: 5033DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1

Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31347 Accepted: 13942DescriptionBessie has gone to the mall's jewelry store and spies a ch

FATETime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11009    Accepted Submission(s): 5191Problem Description最近xhd正在玩一款叫做FATE

饭卡Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19702    Accepted Submission(s): 6867Problem Description电子科大本部食堂的饭卡有一种很诡异的

Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19340    Accepted Submission(s): 5473Problem

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28091    Accepted Submission(s): 12529Problem Descript

Bridging signalsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1169    Accepted Submission(s): 767Problem Description'Oh no, they'v

Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5384    Accepted Submission(s): 1742Problem Desc

//LIS 最长上升子序列 o(n^2)/*arr[k]>arr[i]&&dp[k]<dp[i]+11 3 4 2 5 2 2 2 2 3 2 3 2 4*/#include #include #include using namespace std;const int maxn=1000+10;int arr[maxn],dp[maxn]; //d

作者：Hawstein出处：http://hawstein.com/posts/dp-knapsack.html声明：本文采用以下协议进行授权： 自由转载-非商用-非衍生-保持署名|Creative Commons BY-NC-ND 3.0 ，转载请注明作者及出处。一切都要从一则故事说起。话说有一哥们去森林里玩发现了一堆宝石，他数了数，一共有n个。 但他身上能装

C. Geometric Progressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp loves geometric progressio

matrixTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 450    Accepted Submission(s): 270Problem DescriptionGiven a matrix wi

Jam's balanceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 733    Accepted Submission(s): 351Problem DescriptionJim has a bala

CA Loves GCDTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1212    Accepted Submission(s): 397Problem DescriptionCA is a

题目：http://hihocoder.com/problemset/problem/1270//还是要静下心来好好想想，想通了再写。。。 乱交一点意义都没有//还是学长说的对："提交简单，AC不易，且敲且叹息”。。。//这题是个完全背包不过稍有变形 完全背包求得是给你一个背包V问装满V可以取得最大值，此题是取得最小值。//不过需要注意题目要求可以溢出 就是物品的容量即使大于V也可

链接：http://codeforces.com/problemset/problem/682/C    dp[v]表示以v为终点所需消耗的最大值  当d[v]大于a[v]时就删除以v为根节点的子树#include using namespace std;#define ll long longconst int N=1e5+5;vector >G[N];ll n,a[