-
Notifications
You must be signed in to change notification settings - Fork 0
/
10285.cpp
66 lines (56 loc) · 1.22 KB
/
10285.cpp
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 <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pi 2*acos(0.0)
#define eps 1e-9
#define PII pair<int,int>
#define PDD pair<double,double>
#define LL long long
#define INF 1000000000
using namespace std;
int dx[]={-1, 0, 1, 0};
int dy[]={ 0, 1, 0,-1};
int T,bawah,samping,x,y,ans;
int peta[110][110];
int dp[110][110];
char nama[200];
int solve(int x,int y)
{
if(dp[x][y]!=-1) return(dp[x][y]);
int &ret = dp[x][y] = 1;
for(int t=0;t<4;t++)
{
int sx=x+dx[t],sy=y+dy[t];
if((sx>=1)&&(sx<=samping)&&(sy>=1)&&(sy<=bawah))
if(peta[sx][sy]<peta[x][y]) ret=max(ret,solve(sx,sy)+1);
}
return(ret);
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%s %d %d",nama,&bawah,&samping);
for(y=1;y<=bawah;y++)
for(x=1;x<=samping;x++) scanf("%d",&peta[x][y]);
memset(dp,-1,sizeof(dp));
ans=0;
for(y=1;y<=bawah;y++)
for(x=1;x<=samping;x++) ans=max(ans,solve(x,y));
printf("%s: %d\n",nama,ans);
}
return 0;
}