【HDOJ】1500 Chopsticks

DP。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <algorithm>
 #include <iostream>
 using namespace std;

 #define MAXN 5005
 #define MAXK 1005
 #define INF 0x3f3f3f3f
 int a[MAXN];
 int s[MAXN];
 int dp[MAXN][MAXK];

 int main() {
     int n, K, t;
     int i, j, k;

 #ifndef ONLINE_JUDGE
     freopen("data.in", "r", stdin);
 #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%d %d", &K, &n);
         K += ;
         for (i=; i<=n; ++i)
            scanf("%d", &a[i]);
         for (i=; i<n; ++i)
             s[i] = (a[i+]-a[i])*(a[i+]-a[i]);
         memset(dp, 0x3f, sizeof(dp));
         for (i=; i<=n; ++i)
             dp[i][] = ;
         for (j=; j<=K; ++j) {
             for (i=n+-*j; i>; --i) {
                 dp[i][j] = min(dp[i][j], dp[i+][j-]+s[i]);
                 dp[i][j] = min(dp[i][j], dp[i+][j]);
             }
         }
         int ans = INF;
         for (j=; j<=n; ++j)
             if (dp[j][K] < ans)
                 ans = dp[j][K];
         printf("%d\n", ans);
     }

     return ;
 }