Some.

ZipperTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17232 Accepted: 6131DescriptionGiven three strings, you are to determine whether the third string

Increasing SequencesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3089 Accepted: 1179DescriptionGiven a string of digits, insert commas to create a se

问题及代码：有n种不同大小的数字a[i]，每种各m[i]个。判断是否可以从这些数字之中选出若干使它们的和恰好为K。#include#include#include#includeusing namespace std;#define MAXN 10010int n,K,a[MAXN],m[MAXN];bool dp[MAXN][MAXN];void solve(

Space ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10506 Accepted: 4994DescriptionThe cows are going to space! They plan to achieve orbit by

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32746    Accepted Submission(s): 14818Problem DescriptionA subsequ

Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34117 Accepted: 12362DescriptionA Bank plans to install a machine for cash withdrawal. The m

BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14034 Accepted: 8824DescriptionGigel has a strange "balance" and he wants to poise it. Actually

PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9084 Accepted: 4571DescriptionIn Pearlania everybody is fond of pearls. One company, called The Ro

Stock ExchangeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6647 Accepted: 2342DescriptionThe world financial crisis is quite a subject. Some people a

AlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16527 Accepted: 5424DescriptionIn the army, a platoon is composed by n soldiers. During the mor

Cow BowlingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18487 Accepted: 12308DescriptionThe cows don't use actual bowling balls when they go bowlin

你有一个日志文件，里面记录着各种系统事件的详细信息。自然的，事件的时间戳按照严格递增顺序排列（不会有两个事件在完全相同的时刻发生）。遗憾的是，你的系统被病毒感染了，日志文件中混入了病毒生成的随机伪事件（但真实事件的相对顺序保持不变）。备份的日志文件也被感染了，但由于病毒采用的随机感染方法，主日志文件和备份日志文件在感染后可能会变得不一样。给出被感染的主日志和备份日志，求真实事件序列的最长可

Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18533 Accepted: 6692DescriptionYou are given a sequence of n integers a1 , a2 , ... , an 

Function Run FunTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18930 Accepted: 9612DescriptionWe all love recursion! Don't we? Consider a three-par

Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 51826 Accepted: 24285Case Time Limit: 2000MSDescriptionFor the daily milking, Far

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

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

CoinsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11770    Accepted Submission(s): 4686Problem DescriptionWhuacmers use coins.The

Beauty of ArrayTime Limit: 2 Seconds      Memory Limit: 65536 KB Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the arr

Max Sum Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 10   Accepted Submission(s) : 9Font: Times New Roman | Verdana | Georgia Font Size

FatMouse's Speed Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 22   Accepted Submission(s) : 12Special Judge Font: Times New Roman | Ver

最少拦截系统 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 47   Accepted Submission(s) : 19Font: Times New Roman | Verdana | Georgia Font Size

Humble Numbers Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 30   Accepted Submission(s) : 13Font: Times New Roman | Verdana | Georgia F

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47666    Accepted Submission(s): 19880Problem DescriptionMany years ag

Traveling by StagecoachTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2802 Accepted: 1010 Special JudgeDescriptionOnce upon a time, there was a tra

石子合并（一）时间限制：1000 ms  |  内存限制：65535 KB难度：3描述     有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。输入有多组测试数据，输入到文件结束。每组测试数据第一行有一个整数n，表示有n堆石子。

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5484 Accepted: 2946DescriptionWe give the following inductive definition of a “regular bracket

2335: 0-1背包问题 Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 98  Solved: 61[Submit][Status][Web Board]Description 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解0-1背包问题。 0-1 背包

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

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

F(x)Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3567    Accepted Submission(s): 1330Problem DescriptionFor a decimal number x w

RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19371    Accepted Submission(s): 7149Problem DescriptionThe aspiring Roy th

动态规划一直是ACM竞赛中的重点，同时又是难点，因为该算法时间效率高，代码量少，多元性强，主要考察思维能力、建模抽象能力、灵活度。本人动态规划博客地址：http://blog.youkuaiyun.com/cc_again/article/category/1261899******************************************************************

string LCS(string str1,string str2)//str2是str1的逆序{ string fin=str1; int length1,length2; int arr[MAXN][MAXN]; length1 = str1.length(); length2 = str2.length(); memset(arr,0,s...