UVA - 10285 Longest Run on a Snowboard

最新推荐文章于 2022-03-04 10:33:04 发布

MrFox_

最新推荐文章于 2022-03-04 10:33:04 发布

阅读量390

点赞数

分类专栏：算法入门经典第二版第九章动态规划

本文链接：https://blog.csdn.net/MrFox_/article/details/46425423

版权

算法入门经典第二版第九章动态规划专栏收录该内容

11 篇文章 0 订阅

订阅专栏

DAG 有向无环图找最长的一段路不限始点和终点开始R和C弄反了一直调也不出结果査代码还是直接输出dp数组比较直观

#include<iostream>
#include<cstdio>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
#define INF (1<<30)
const int maxn = 100 + 5;
int vis[maxn][maxn];
int dp[maxn][maxn];
int k[maxn][maxn];
string name;
int R, C;
int solve(int i, int j)
{
    if(k[i][j] == 1) return dp[i][j];
    k[i][j] = 1;
    int cnt = 0;
    if(i-1 >= 1 && vis[i][j] > vis[i-1][j]) cnt = max(cnt, solve(i-1, j) + 1);
    if(i+1 <= R && vis[i][j] > vis[i+1][j]) cnt = max(cnt, solve(i+1, j) + 1);
    if(j-1 >= 1 && vis[i][j] > vis[i][j-1]) cnt = max(cnt, solve(i, j-1) + 1);
    if(j+1 <= C && vis[i][j] > vis[i][j+1]) cnt = max(cnt, solve(i, j+1) + 1);
    return dp[i][j] = cnt;
}
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        memset(vis,0,sizeof(vis));
        memset(dp,0,sizeof(dp));
        memset(k,0,sizeof(k));
        cin >> name >> R >> C;
        for(int i = 1; i <= R; ++i)
            for(int j = 1; j <= C; ++j)
                cin >> vis[i][j];
        int Max = 0;
        for(int i = 1; i <= R; ++i)
        {
            for(int j = 1; j <= C; ++j)
            {
                Max = max(Max, solve(i,j));
            }
        }
        cout << name << ":" << " " << Max+1 << endl;
    }
    return 0;
}