花店橱窗[DP]

传送门

记录一下从哪个转移过来的就好

---

#include<bits/stdc++.h>
#define N 150
#define inf 0x3fffffff
using namespace std;
int f[N][N],n,m,val[N][N],pre[N][N],ans=-inf,st,a[N];
void dfs(int i,int j){
	if(i<=0) return; 
	a[i] = j; dfs(i-1,pre[i][j]);
}
int main(){
	memset(f,-127,sizeof(f)); f[0][0]=0;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			scanf("%d",&val[i][j]);
	for(int i=1;i<=n;i++){
		for(int j=i;j<=m;j++){
			for(int k=i-1;k<j;k++){
				if(f[i-1][k]+val[i][j]>f[i][j]){
					f[i][j] = f[i-1][k] + val[i][j];
					pre[i][j] = k;
				}
			}
		}
	}
	for(int i=n;i<=m;i++)
		if(f[n][i]>ans) ans = f[n][i] , st=i; 
	printf("%d\n",ans); dfs(n,st);
	for(int i=1;i<=n;i++) printf("%d ",a[i]); return 0;
}