2015年9月13日
摘要: RMQ动态规划的思想int a[1100];int dp[maxn][20];void rmq_init(){ for(int i=0;i<n;i++) dp[i][0]=a[i]; for(int j=1;(1<<j)<=n;j++) for(int i=0... 阅读全文
posted @ 2015-09-13 20:10 Beserious 阅读(171) 评论(0) 推荐(0) 编辑
摘要: The Water ProblemTime Limit: 1500/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 153Accepted Submission(s): 123P... 阅读全文
posted @ 2015-09-13 20:08 Beserious 阅读(179) 评论(0) 推荐(0) 编辑
摘要: PondsTime Limit: 1500/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 282Accepted Submission(s): 86Problem Descri... 阅读全文
posted @ 2015-09-13 19:32 Beserious 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Travel Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 94 Accepted Submission(s): 32 Problem De 阅读全文
posted @ 2015-09-13 16:44 Beserious 阅读(198) 评论(0) 推荐(0) 编辑