Discussion @ 1146. Maximum Sum @ Timus Online Judge

Neo Nomaly Please Help. I use right DP but I have WA3... [3] // Problem 1146. Maximum Sum 12 Jan 2006 22:06

[code deleted]

Edited by moderator 24.11.2019 13:21

wwwwww Re: Please Help. I use right DP but I have WA3... [2] // Problem 1146. Maximum Sum 12 Jan 2006 23:53

You have overflow:

...
up:=1;
for down:=1 to n do begin
sum:=b[j,down]-b[j,up-1]-b[i-1,down]+b[i-1,up-1];
...

In first step b[j,up-1] = b[j][0] but b is
array[1..maxn,1..maxn] of longint (0 is invalid)

Neo Nomaly Re: Please Help. I use right DP but I have WA3... [1] // Problem 1146. Maximum Sum 15 Jan 2006 13:33

Thanks, but after chaging
a,b:array[1..maxn,1..maxn] of longint
to
a,b:array[0..maxn,0..maxn] of longint
i also have WA3

Loch Re: Please Help. I use right DP but I have WA3... // Problem 1146. Maximum Sum 16 Jan 2006 16:49

Thanks, I got AC.
My problem: I wroute : up:=down;
But need : up:=down+1;

Discussion of Problem 1146. Maximum Sum