摘要：悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12417 Accepted Submission(s): 5250Problem Description急！灾区的食物依然短缺！为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你一共有资金n元，而市场有m种大米，每种大米都是袋装产品，其价格不等，并且只能整袋购买。请问：你用有限的资金最多能采购多少公斤粮... 阅读全文

摘要：FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8025 Accepted Submission(s): 3556Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on.. 阅读全文

摘要：Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3362 Accepted Submission(s): 1060Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. I... 阅读全文

摘要：Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13752Accepted Submission(s): 3920Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文

摘要：Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9526 Accepted Submission(s): 4803Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action... 阅读全文

摘要：Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20061Accepted Submission(s): 8571Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another. 阅读全文

摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23977Accepted Submission(s): 9729Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such 阅读全文

摘要：威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1141 Accepted Submission(s): 600Problem Description 威威猫最近不务正业，每天沉迷于游戏“打地鼠”。 每当朋友们劝他别太着迷游戏，应该好好工作的时候，他总是说，我是威威猫，猫打老鼠就是我的工作！ 无话可说... 我们知道，打地鼠是一款经典小游戏，规则很简单：每隔一个时间段就会从地下冒出一只或多只地鼠，玩... 阅读全文

摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21666 Accepted Submission(s): 7309Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能... 阅读全文

摘要：如果一个自然数N的K进制表示中任意的相邻的两位都不是相邻的数字，那么我们就说这个数是K好数。求L位K进制数中K好数的数目。例如K = 4，L = 2的时候，所有K好数为11、13、20、22、30、31、33 共7个。给定K、L，求L位K好数的数目。#include__int64 f[20][20];int main(){ int k,l,i,j,p; __int64 sum=0; scanf("%d%d",&k,&l); for(i=0;i<=k-1;i++) f[1][i]=1; for(i=2;i<=l;i++) { for(j=0;j&l 阅读全文

摘要：/*最长上升子序列*//*输入：54 2 3 1 5输出：3*/#include#define MAX_N 100#define max(x, y) x>y?x:yusing namespace std;int n;int a[MAX_N];int dp[MAX_N];void LIS(){ int res = 1; for(int i = 0; i >n; for(int i = 0; i >a[i]; LIS(); system("PAUSE"); return 0;} 阅读全文

摘要：/*最长公共子序列*/#include#include#define max(x, y) a>b?a:b#define For(t, i, j) for(t = i; t = c[i][j-1]) { c[i][j] = c[i-1][j]; b[i][j] = 2;//正上 } else { c[i][j] = c[i][j-1]; b[i][j] = 3;//左 } } cout>x>>y; LCS(); system("pause"); return 0;} 阅读全文

摘要：Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 120365Accepted Submission(s): 27835Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the ma 阅读全文