Prim

阿牛的EOF牛肉串Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50807 Accepted Submission(s): 24035Problem Description今年的ACM暑期集训队一共有18人，分为6支队伍。其...

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 25929 Accepted Submission(s): 10950Problem Description 急！灾区的食物依然短缺

Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2299 Accepted Submission(s): 1112Problem Description Now here is a matrix

完全背包 时间限制：3000 ms | 内存限制：65535 KB 难度：4 描述 直接说题意，完全背包定义有N种物品和一个容量为V的背包，每种物品都有无限件可用。第i种物品的体积是c，价值是w。求解将哪些物品装入背包可使这些物品的体积总和不超过背包容量，且价值总和最大。本题要求是背包恰好装满背包时，求出最大价值总和是多少。如果不能恰好装满背包，输出NO输入 第一行： N 表示有多少组

Matrix Swapping IITime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1804 Accepted Submission(s): 1199Problem Description Given an N * M matri

原文链接 最长公共子序列路径记录 最长公共子序列转化为最长递增子序列问题，O(　n*log(n)　) 　　（转自：http://karsbin.blog.51cto.com/1156716/966387） 　　注意到num[i][j]仅在A[i]==B[j]处才增加，对于不相等的地方对最终值是没有影响的。故而枚举相等点处可以对上述动态规划算法进行优化。 　　举例说明： 　　A：abdba

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34606 Accepted Submission(s): 15804Problem Description A subsequence of a

三国志 时间限制：3000 ms | 内存限制：65535 KB 难度：5 描述 《三国志》是一款很经典的经营策略类游戏。我们的小白同学是这款游戏的忠实玩家。现在他把游戏简化一下，地图上只有他一方势力，现在他只有一个城池，而他周边有一些无人占的空城，但是这些空城中有很多不同数量的同种财宝。我们的小白同学虎视眈眈的看着这些城池中的财宝。按照游戏的规则，他只要指派一名武将攻占这座城池，里面的

BeansTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4488 Accepted Submission(s): 2115Problem Description Bean-eating is an interesting gam

CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12753 Accepted Submission(s): 5120Problem Description Whuacmers use coins.They have co

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 36662 Accepted Submission(s): 12734Problem Description Nowadays, we all kn

How to TypeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6239 Accepted Submission(s): 2821Problem Description Pirates have finished devel

FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12281 Accepted Submission(s): 5809Problem Description 最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在

How many waysTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4953 Accepted Submission(s): 2937Problem Description 这是一个简单的生存游戏，你控制一个机器人从一个棋盘

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34304 Accepted Submission(s): 15564Problem Description Nowa

命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17120 Accepted Submission(s): 5973Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了！ 可谁能想到，yif

//来一发多重背包模板const int maxn=1005;int cost[maxn];//花费int value[maxn];//价值int num[maxn];//数量int DP[maxn];//花费i的最大价值DP[i]int V;//最大花费int N;//物品种类数量void ZeroOnePack(int Cost,int Value)//01背包{ fo

Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21489 Accepted Submission(s): 10927Problem Description Before ACM can do anything

龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16597 Accepted Submission(s): 6259Problem Description 据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌

CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1850 Accepted Submission(s): 875Problem Description Today is CRB’s

滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 95035 Accepted: 36011 DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个

Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10252 Accepted Submission(s): 4332Problem Description There is going to be

FatMouse’s SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15259 Accepted Submission(s): 6724 Special JudgeProblem Description FatMou

Traveling salesmen of . (the prestigious Korean internet company) report their current location to the company on a regular basis. They also have to report their new location to the company if they a

We say a sequence of characters is a palindrome if it is the same written forwards and backwards. For example, ‘racecar’ is a palindrome, but ‘fastcar’ is not. A partition of a sequence of chara

A Subsequence is a sequence obtained by deleting zero or more characters in a string. A Palindrome is a string which when read from left to right, reads same as when read from right to left. Given a s

A common way to uniquely encode a string is by replacing its consecutive repeating characters (or “chunks”) by the number of times the character occurs followed by the character itself. For example,

Wavio is a sequence of integers. It has some interesting properties. • Wavio is of odd length i.e. L = 2 ∗ n + 1. • The first (n + 1) integers of Wavio sequence makes a strictly increasing sequence.

C. Hard problem time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vasiliy is fond of solving different tasks. Today he found one he wasn’t ab

Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7356 Accepted: 4228 DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State

最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28914 Accepted Submission(s): 13108Problem Description 给定K个整数的序列{ N1, N2, …, NK }，其任

邮票分你一半 时间限制：1000 ms | 内存限制：65535 KB 难度：3 描述 小珂最近收集了些邮票，他想把其中的一些给他的好朋友小明。每张邮票上都有分值，他们想把这些邮票分成两份，并且使这两份邮票的分值和相差最小（就是小珂得到的邮票分值和与小明的差值最小），现在每张邮票的分值已经知道了，他们已经分好了，你知道最后他们得到的邮票分值和相差多少吗？ 输入 第一行只有一

To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11800 Accepted Submission(s): 5702Problem Description Given a two-dimensional arr

最大和 时间限制：1000 ms | 内存限制：65535 KB 难度：5 描述 给定一个由整数组成二维矩阵（r*c），现在需要找出它的一个子矩阵，使得这个子矩阵内的所有元素之和最大，并把这个子矩阵称为最大子矩阵。 例子： 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 其最大子矩阵为：9 2 -4 1 -1 8 其元素总和

City GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6625 Accepted Submission(s): 2855Problem Description Bob is a strategy game progra

Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16869 Accepted Submission(s): 5000Problem Description A his

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 45832 Accepted Submission(s): 19075Problem Description Many years ago , in Te

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32741 Accepted Submission(s): 11425Problem Description Nowadays, we all kn

最长公共子序列 时间限制：3000 ms | 内存限制：65535 KB 难度：3 描述 咱们就不拐弯抹角了，如题，需要你做的就是写一个程序，得出最长公共子序列。 tip：最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的

饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19424 Accepted Submission(s): 6773Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购