NUIST-oj/p1029.cpp at master · EvenTiming/NUIST-oj · GitHub

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
#include<algorithm>
using namespace std;
int pathlen(int i,int j);
int p[100][100];
int dp[100][100];
int m,n;
int main(){


while(cin>>m>>n){
    int i,j;
   for(i=0;i<m;i++){
        for(j=0;j<n;j++){
            cin>>p[i][j];
            dp[i][j]=-1;
        }
    }
     for(i=0;i<m;i++){
        for(j=0;j<n;j++){
        dp[i][j]=pathlen(i,j);
        }
    }
    int Max=0;
    for(i=0;i<m;i++){
        for(j=0;j<n;j++){

        if(dp[i][j]>Max)

            Max=dp[i][j];
        }

    }
cout<<Max+1<<endl;
}
return 0;
}
int pathlen(int i,int j){
    int a=0,b=0,c=0,d=0;
        if(i+1<m&&p[i+1][j]>p[i][j]){
            if(dp[i+1][j]!=-1)
                c=1+dp[i+1][j];
            else
                c=1+pathlen(i+1,j);
                }

        if(j+1<n&&p[i][j+1]>p[i][j]){
            if(dp[i][j+1]!=-1)
                d=1+dp[i][j+1];
            else
                d=1+pathlen(i,j+1);
                }
        if(j-1>=0&&p[i][j-1]>p[i][j]){
            if(dp[i][j-1]!=-1)
                a=1+dp[i][j-1];
            else
                a=1+pathlen(i,j-1);
                }
         if(i-1>=0&&p[i-1][j]>p[i][j]){
            if(dp[i-1][j]!=-1)
                b=1+dp[i-1][j];
            else
                b=1+pathlen(i-1,j);
                }
        return max(max(a,b),max(c,d));
    }