#1#6wa求助qwq

P1434 [SHOI2002] 滑雪

```cpp #include<iostream> #include<cstdio> #include<cmath> using namespace std; int dx[4]={0,0,1,-1}; int dy[4]={1,-1,0,0}; int n,m,a[201][201],s[201][201],ans; bool use[201][201]; int dfs(int x,int y){ if(s[x][y])return s[x][y]; s[x][y]=1; for(int i=0;i<4;i++) { int xx=dx[i]+x; int yy=dy[i]+y; if(xx>0&&yy>0&&xx<=n&&yy<=m&&a[x][y]>a[xx][yy]){ dfs(xx,yy); s[x][y]=max(s[x][y],s[xx][yy]+1); } } return s[x][y]; } int main() { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%d",&a[i][j]); for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) ans=max(ans,dfs(i,j)); printf("%d",ans); return 0; } AC代码(求关注)
by lienze2012 @ 2023-04-22 17:04:00


|