蒻菜_羊羊羊的专栏

Seaside Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1130    Accepted Submission(s): 825 Problem Description XiaoY is living in

Human Gene Functions Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2733    Accepted Submission(s): 1545 Problem Description It is

Monkey and Banana Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9861    Accepted Submission(s): 5126 Problem Description A group

To The Max Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9922    Accepted Submission(s): 4791 Problem Description Given a two-dim

Longest Ordered Subsequence Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 34454   Accepted: 15135 Description A numeric sequence of ai is ordered if a1 a2 a

LITTLE SHOP OF FLOWERS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 19011   Accepted: 8791 Description You want to arrange the window of your flower shop

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4850   Accepted: 2751 Description There is going to be a party to celebrate the 80-th Anniv

Strategic game Time Limit: 2000MS   Memory Limit: 10000K Total Submissions: 6722   Accepted: 3095 Description Bob enjoys playing computer games, especially strategic game

Palindrome Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 55248   Accepted: 19105 Description A palindrome is a symmetrical string, that is, a string read

Balance Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 11431   Accepted: 7127 Description Gigel has a strange "balance" and he wants to poise it. Actually,

Cash Machine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28982   Accepted: 10375 Description A Bank plans to install a machine for cash withdrawal. The m

真动态规划版(自底而下): #include using namespace std; const int maxn = 10001; int m,n; char b[maxn][maxn]; //回溯时保存路径 int c[maxn][maxn]; //最长子序列 void LCS(char *x,char *y) { int i,j; for(i=0;i<=m;i++)

最大报销额 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16926    Accepted Submission(s): 4929 Problem Description 现有一笔经费可以报销一定额度的发票。允许报销的

Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20708    Accepted Submission(s): 6886 Problem Description Now I t