摘要: 1 #include<bits/stdc++.h> 2 using namespace std; 3 #define MAXN 1000+10 4 int dp[MAXN][MAXN], a[MAXN]; 5 6 void InitRMQ(int l, int r, int n){ 7 int k 阅读全文
posted @ 2017-01-22 21:29 Robin! 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Description FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day an 阅读全文
posted @ 2017-01-22 21:15 Robin! 阅读(113) 评论(0) 推荐(0) 编辑