제출 #9656

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
9656		veckal	On grid (kriii2_O)	C++14	1 / 4	1000 ms	2140 KiB

O

#include<stdio.h>
#include<string.h>

int r, c, grid[300][300], psum[300][300];
int cache[300][300];

inline int max(int a, int b) {
	return (a>b)?a:b;
}

int onGrid(int y, int x) {
	int &ret = cache[y][x];
	if (~ret) return ret;
	ret = psum[y][x];
	if (!r || !c) return ret;
	for (int i=0; i<y; ++i)
		for (int j=0; j<x; ++j)
			ret = max(ret, psum[y][x]-psum[i][x]-psum[y][j]+psum[i][j]+onGrid(i, j));
	return ret;
}

int main() {
	scanf("%d%d", &r, &c);
	for (int i=0; i<r; ++i)
		for (int j=0; j<c; ++j)
			scanf("%d", grid[i]+j);
	psum[0][0] = grid[0][0];
	for (int i=1; i<c; ++i)
		psum[0][i] = psum[0][i-1] + grid[0][i];
	for (int i=1; i<r; ++i) {
		psum[i][0] = grid[i][0];
		for (int j=1; j<c; ++j)
			psum[i][j] = psum[i][j-1] + grid[i][j];
		for (int j=0; j<c; ++j)
			psum[i][j] += psum[i-1][j];
	}
	memset(cache, -1, sizeof cache);
	printf("%d\n", onGrid(r-1, c-1));
	return 0;
}

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