SGU 104 Little shop of flowers

简单的dp，细心点就可以了~

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a) ; i >= 1 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 111;
int n,m;
int a[maxn][maxn];
int dp[maxn][maxn];
short int w[maxn][maxn][maxn];

int dpstart()
{
    FOR(i,1,n) FOR(j,1,m)
    {
        dp[i][j]=-inf;
    }
    memset(w,0,sizeof(w));
    FOR(i,1,n) FOR(j,i,m) FFD(k,j)
    {
        if(k>=i && dp[i-1][k-1]+a[i][k] > dp[i][j])
        {
            dp[i][j] = dp[i-1][k-1]+a[i][k];
            FOR(u,1,i-1)
            {
                w[i][j][u]=w[i-1][k-1][u];
            }
            w[i][j][i]=k;

        }
    }
    return dp[n][m];
}

int main()
{
    while(cin>>n>>m)
    {
        FOR(i,1,n) FOR(j,1,m)
        {
            cin>>a[i][j];
        }
        cout<<dpstart()<<endl;
        FOR(i,1,n-1)
        {
            cout<<w[n][m][i]<<" ";
        }
        cout<<w[n][m][n]<<endl;
    }
    return 0;
}