hdu6376 度度熊剪纸条

思路：

01背包。有些细节需要注意一下，比如k = 0的情况。

实现：

 #include <bits/stdc++.h>
 using namespace std;
 typedef pair<int, int> pii;
 const int INF = 0x3f3f3f3f;

 int dp[];

 int main()
 {
     int n, k; string s;
     while (cin >> n >> k >> s)
     {
         k++;
         fill(dp, dp + k + , -INF);
         vector<pii> v;
         int begin = ;
         for (int i = ; i < n; i++)
         {
             int j = i;
             while (j < n && s[j] == '') j++;
             if (j - i)
             {
                 if (i == ) { v.push_back(pii(, j - i)); begin = j - i; }
                 else if (j == n) v.push_back(pii(, j - i));
                 else v.push_back(pii(, j - i));
                 i = j;
             }
         }
         if (k == ) { cout << begin << endl; continue; }
         dp[] = ;
         for (int i = ; i < v.size(); i++)
         {
             for (int j = k; j >= ; j--)
                 if (j >= v[i].first)
                     dp[j] = max(dp[j], dp[j - v[i].first] + v[i].second);
         }
         int ans = ;
         for (int i = ; i <= k; i++) ans = max(ans, dp[i]);
         cout << ans << endl;
     }
     return ;
 }