浮生匆忙，与君同往

此题需要写两个函数，最长上升序列的长度和最长不上升序列的长度。LCS函数（计算最长不下降序列的长度，动态规划的思路:首先数组里面的长度都初始化为1，然后开始遍历数组，计算以当前i为最低值时的最长不上升序列的长度，计算的时候再设置一个FOR循环遍i之前的所有值，如果i之前有值大于等于i的值P，那么就是说，i的值可以是P的长度加1。所以最长的长度就是整个0-i 区间里面长度最大的。这个

题目链接：http://codeforces.com/problemset/problem/455/AA. Boredomtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlex doesn’t like boredom. That’...

C. k-Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputQuite recently a creative student Lesha had a lect

三维DP数组，DP[I][J][K]表示 K个棋子占了整个棋盘的I行J列，并不是第I行第J列有K个棋子。所以dp[i][j][k]就是由dp[i-1][j][k-1]......等四种状态得来，就是说，第K个棋子出现时，总体棋子占领的行数多了一行，或者多了一列，或者多了一行一列，或者行列都没有增加。dp[i][j][k]的概率就是上一种状态的概率乘放第K个棋子的概率（就是当前符合条件的空格

B. Mashmokh and ACMtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMashmokh's boss, Bimokh, didn't like Mas

Gray codeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 904    Accepted Submission(s): 510Problem DescriptionThe reflected bi

题意：求出满足要求的子串个数，要求是：子串都是数字，并且能被3整除。做法：动态规划的思想。弄一个数组记录当前选定值之前的情况，num[0]记录余数为0的个数。假设选定当前值作为数字的最后一个位数，如果当前值mod3等于1，那么前面num[2]的数加上当前值都能变成余数0，所以num[0]=num[2].以此类推......不用long long 会wa。#include#includ

C. Watching Fireworks is Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA festival will be held in a t

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

湫湫系列故事——减肥记ITime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3524    Accepted Submission(s): 1768Problem Description　　对于吃货来说，过年

1680: 能量项链Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 39  Solved: 13  Scores:90.11[Submit][Status][BBS]Description在Mars星球上，每个Mars人都随身佩带着一串能量项链。在项链上有 N颗能量珠。能量珠是一颗有头标记与尾标记的珠

1503: 公路乘车Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 21  Solved: 13  Scores:89.83[Submit][Status][BBS]Description一个特别的单行街道在每公里处有一个汽车站。顾客根据他们乘坐汽车的公里使来付费。例如下表就是一个费用的单子。   没有一辆车子行驶超过1

Piggy-BankTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15796    Accepted Submission(s): 7968Problem DescriptionBefore ACM can

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19485    Accepted Submission(s): 8242Problem Description急！灾

WHUgirlsTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2323 Accepted Submission(s): 884Problem DescriptionThere are many pretty girl

Little Tiger vs. Deep MonkeyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1433 Accepted Submission(s): 501Problem Description A crowd of

ZOJ Problem Set - 3822DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special Judge Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays

B. Two Cakestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSasha and Dima want to buy two n-tier cakes. Each cake should consist of n differe...