hdu1712 ACboy needs your help 分组背包

最基础的分组背包~

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 #include <algorithm>
 #include <queue>
 #include <deque>
 #include <queue>
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
 #include <utility>
 #include <functional>
 #include <fstream>
 #include <iomanip>
 #include <sstream>
 #include <numeric>
 #include <cassert>
 #include <ctime>
 #include <iterator>
 const int INF = 0x3f3f3f3f;
 const int dir[][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};
 using namespace std;
 int dp[], a[][];
 int main(void)
 {
     #ifndef ONLINE_JUDGE
     freopen("in.txt", "r", stdin );
     #endif // ONLINE_JUDGE
     int n,m;
     while (~scanf("%d%d",&n,&m)&&(n||m))
     {
         for (int i=;i<=n;++i)
         {
             for (int j=;j<=m;++j) scanf("%d",&a[i][j]);
         }
         memset(dp,,sizeof(dp));
         for (int i=;i<=n;++i)
         {
             for (int v=m;v>=;--v)
             {
                 for (int j=;j<=v;++j)
                 {
                     dp[v]=max(dp[v],dp[v-j]+a[i][j]);
                 }
             }
         }
         printf("%d\n",dp[m]);
     }
     return ;
 }

没什么可说的。1Y