90分求救QAQ

#include"cstdio"
#include"cstring"
#include"iostream"
#include"algorithm"
using namespace std;

const int MAXN=605;
const int MAXM=55;

int n,m,maxn,ansk,ansi;
int lis[MAXN][MAXN];
int f[MAXM][MAXN],pre[MAXM][MAXN];

int query(int i,int j){return lis[i][n]-lis[i][i]-lis[j][n]+lis[j][i];}

void DFS(int m,int n)
{
	if(m==0) return;
	DFS(m-1,pre[m][n]);
	printf("%d ",n);
	return;
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<n;++i){
		for(int j=i+1;j<=n;++j){
			scanf("%d",&lis[i][j]);
		}
	}for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			lis[i][j]+=lis[i-1][j]+lis[i][j-1]-lis[i-1][j-1];
		}
	}for(int i=1;i<n;++i){
		for(int j=0;j<i;++j){
			for(int k=1;k<=min(j+1,m);++k){
				if(f[k][i]<f[k-1][j]+query(i,j)){
					f[k][i]=f[k-1][j]+query(i,j);pre[k][i]=j;
					if(f[k][i]>maxn) maxn=f[k][i],ansk=k,ansi=i;
				}
			}
		}
	}DFS(ansk,ansi);
	return 0;
}