动态规划训练20 [Treats for the Cows POJ - 3186 ]
Treats for the Cows POJ - 3186 简单的区间DP,就不解释了。#include#includeusing namespace std;const int INF=1e9;const int maxn=2005;int n, a[maxn];int dp[maxn][maxn];int main() { scanf("%d