3 int a
[100][100],f
[100][100],p
[100][100],m
,n
,i
,j
,k
,ps
,ans
=-2147483647;
4 void write(int dep
,int r
) {
5 if (dep
>1) write(dep
-1,p
[dep
][r
]-1);
11 for (j
=1;j
<=n
;j
++) { cin
>>a
[i
][j
]; f
[i
][j
]=0; }
14 for (j
=i
;j
<=n
-m
+i
;j
++) {
15 f
[i
][i
-1]=-2147483647;
16 if (f
[i
-1][j
-1]+a
[i
][j
]>f
[i
][j
-1]) { f
[i
][j
]=f
[i
-1][j
-1]+a
[i
][j
]; p
[i
][j
]=j
; }
17 else { f
[i
][j
]=f
[i
][j
-1]; p
[i
][j
]=p
[i
][j
-1]; }
22 if (f
[m
][i
]>ans
) { ans
=f
[m
][i
]; ps
=i
; }