Submission #9313

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9313	2014-09-28 05:32:26	lemonsqueeze	On grid (kriii2_O)	C++98	4 / 4	464 ms	216972 KiB

O

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
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, m;
long long a[301][301];
long long s[301][301];
long long d[301][301];
long long w[301][301][302];
int main ()
{
  scanf ("%d%d", &n, &m);
  for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) {
    scanf ("%lld", &a[i][j]);
    s[i][j] = s[i-1][j] + s[i][j-1] - s[i-1][j-1] + a[i][j];
  }
  for (int i=1; i<=n; i++) {
    for (int j=1; j<=m; j++) {
      d[i][j] = s[i][j];
      if (j>=2) {
        for (int a=1; a<i; a++) {
          if (d[i][j] < w[a][i][j] + s[i][j] - s[a][j])
            d[i][j] = w[a][i][j] + s[i][j] - s[a][j];
        }
        for (int a=1; a<i; a++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3