Submission #7246

#TimeUsernameProblemLanguageResultExecution timeMemory
7246gs13068배열 탈출 (GA8_array)C++98
100 / 100
608 ms39696 KiB
#include<cstdio>
#include<algorithm>

int a[2223][2223];
int d[2223][2223];

int main()
{
    int i,j,n;
    scanf("%d",&n);
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&a[i][j]);
    for(i=2;i<=n;i++)a[i][0]=-246641;
    for(j=2;j<=n;j++)a[0][j]=-246641;
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)d[i][j]=std::min(d[i-1][j]+std::max(a[i][j]-a[i-1][j]+1,0),d[i][j-1]+std::max(a[i][j]-a[i][j-1]+1,0));
    printf("%d",d[n][n]-a[1][1]-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...