Submission #7340

#	Time	Username	Problem	Language	Result	Execution time	Memory
7340		kriii	배열 탈출 (GA8_array)	C++98	0 / 100	0 ms	65536 KiB

array

#include <stdio.h>
#include <algorithm>

int N; long long A[2222][2222],D[2222][2222];

int main()
{
	scanf ("%d",&N);
	for (int i=0;i<N;i++) for (int j=0;j<N;j++){
		scanf ("%d",&A[i][j]);
	}
	for (int i=0;i<N;i++) for (int j=0;j<N;j++){
		if (i == 0 && j == 0) D[i][j] = 0;
		else D[i][j] = 1000000000000000ll;
		if (i != 0){
			int a = (A[i-1][j] > A[i][j]) ? 0 : A[i][j] - A[i-1][j] + 1;
			if (D[i][j] > D[i-1][j] + a)
				D[i][j] = D[i-1][j] + a;
		}
		if (j != 0){
			int a = (A[i][j-1] > A[i][j]) ? 0 : A[i][j] - A[i][j-1] + 1;
			if (D[i][j] > D[i][j-1] + a)
				D[i][j] = D[i][j-1] + a;
		}
	}

	printf ("%d\n",D[N-1][N-1]);

	return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 11
• Subtask 3: 0 / 32
• Subtask 4: 0 / 51