Submission #7493

#	Time	Username	Problem	Language	Result	Execution time	Memory
7493		Namnamseo	배열 탈출 (GA8_array)	C++98	100 / 100	656 ms	42416 KiB

array

#include <cstdio>

int map[2300][2300];

int n;

int mincost[2300][2300];

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

int main()
{
    scanf("%d",&n);
    int i,j;
    
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++){
            scanf("%d",&map[i][j]);
            if(i==1 && j==1){
                mincost[i][j]=0;
            } else {
                mincost[i][j]=2147483600;
                if(j>1) {
                    if(map[i][j-1]<=map[i][j]){
                    mincost[i][j]=min(mincost[i][j],
                                      mincost[i][j-1]+map[i][j]-map[i][j-1]+1);
                    } else {
                        mincost[i][j]=min(mincost[i][j],
                                          mincost[i][j-1]);
                    }
                }
                if(i>1) {
                    if(map[i-1][j]<=map[i][j]){
                    mincost[i][j]=min(mincost[i][j],
                                      mincost[i-1][j]+map[i][j]-map[i-1][j]+1);
                    } else {
                        mincost[i][j]=min(mincost[i][j],
                                          mincost[i-1][j]);
                    }
                }
            }
        }
    }
    printf("%d\n",mincost[n][n]);
    
    return 0;
}

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