wa在第7个点，求助orz。。。。90分

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#define inf 0x3f3f3f3f
using namespace std ;
template<class T>void read(T &x){
    x=0;int f=0;char ch=getchar();
    while(ch<'0'||ch>'9'){f|=(ch=='-');ch=getchar();}
    while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    x=f?-x:x;
    return ;
}
int f[110][110],vis[110][110],ans=-1,n,m,map[110][110],ANS[110],flag;
int main()
{
	freopen("11.in","r",stdin);
	read(n); read(m);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			read(map[i][j]);
	for(int i=0;i<=m;++i)
	vis[0][i]=1;
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			if(vis[i-1][j-1])
				f[i][j]=max(f[i][j-1],f[i-1][j-1]+map[i][j]);
			if(f[i][j]==f[i][j-1]) vis[i][j]=vis[i][j-1];
			else vis[i][j]=j;
		}
	}
	for(int i=n;i<=m;++i) 
	{	
		int tmp=ans;
		ans=max(ans,f[n][i]);
		if(tmp!=ans)flag=i;
	}
	ANS[n+1]=inf;
	for(int i=n;i>=1;--i)
	{
		for(int j=flag;j>=1;--j)
		{
			if(vis[i][j]!=vis[i][j-1]&&vis[i][j]<ANS[i+1]) 
			{
				ANS[i]=vis[i][j];
				flag--;
				break;
			}
		}
	}
	printf("%d\n",ans);
	for(int i=1;i<=n;++i)
	printf("%d ",ANS[i]);
}