区间DP
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
GCJ
#include using namespace std;#define maxn 105#define INF 0x7ffffffint dp[maxn][maxn];int Q[maxn];int p, q;int main(){ while(~scanf("%d%d", &p, &q)) { for(int i=1; i<=q; i++)原创 2015-04-02 16:22:40 · 693 阅读 · 0 评论 -
codeforces 250 div2 E
E. The Child and Polygontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis time our child has a simple p原创 2015-08-17 14:12:31 · 1003 阅读 · 0 评论 -
hdu 5396 区间DP
ExpressionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 482 Accepted Submission(s): 284Problem DescriptionTeacher Mai has n原创 2015-08-21 21:09:39 · 620 阅读 · 0 评论