題目

https://www.luogu.org/problemnew/show/P2066

解題思路

設 $f\left[i\right]\left[j\right]$

程式碼

#include<cstdio>
#define rfor(i,x,y) for (register int i=x;i<=y;++i)
#define rfo(i,x,y) for (register int i=x;i>=y;--i)
int f[101],t[101][101],n,m,sum[101][101]; 
int main()
{
	scanf("%d%d",&n,&m); 
	rfor(i,1,n) rfor(j,1,m) scanf("%d",&t[i][j]); 
	rfo(i,n,1) rfo(j,m,1) rfor(k,1,j)
	 if (f[j-k]+t[i][k]>f[j]) {f[j]=f[j-k]+t[i][k]; sum[i][j]=k;}
	printf("%d\n",f[m]); 
	for (register int i=1,j=m;i<=n;putchar(10),i++)
	 printf("%d %d",i,sum[i][j]),j-=sum[i][j]; 
}