1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int INF = ~0u>>1;
typedef pair <int,int> P;
#define MID(x,y) ((x+y)>>1)
#define iabs(x) ((x)>0?(x):-(x))
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define mp make_pair
#define print() cout<<"--------"<<endl
#define maxn 110
int a[maxn][maxn];
int dp[maxn][maxn];
int pre[maxn][maxn];
int main(){
int f,v;
while (~scanf("%d%d", &f, &v)){
memset(pre,0,sizeof(pre));
memset(dp,0,sizeof(dp));
for (int i = 1; i <= f; i ++){
for (int j = 1; j <= v; j ++){
scanf("%d", &a[i][j]);
}
}
for (int i = 1; i <= f; i ++){
dp[i][i] = dp[i-1][i-1] + a[i][i];
pre[i][i] = 1;
}
for (int i = 1; i <= f; i ++){
for (int j = i + 1; j <= v; j ++){
dp[i][j] = dp[i][j-1];
if (dp[i-1][j-1] + a[i][j] > dp[i][j]){
dp[i][j] = dp[i-1][j-1] + a[i][j];
pre[i][j] = 1;
}
}
}
printf("%dn",dp[f][v]);
int ans[maxn],cnt = 0;
for (int i = f,j = v; i > 0; --i){
while (pre[i][j] == 0) j --;
ans[cnt ++] = j --;
}
while (cnt --) printf("%d ",ans[cnt]);
printf("n");
}
return 0;
}
|