UVA 10285 Longest Run on a Snowboard

本文介绍了一种结合记忆化搜索与动态规划的方法,通过深度优先搜索(DFS)来解决路径寻找问题。利用二维数组dp[][]记录已搜索的最佳路径长度,以避免重复计算并提高效率。文章提供了完整的C++代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

记忆化搜索,跟以前的做过的 滑雪 一样的。

DP+DFS。用dp[][]保存搜索记录,然后满足条件累加即可。


#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<stack>
#include<iostream>
#include<list>
#include<set>
#include<bitset>
#include<vector>
#include<cmath>

#define INF 0x7fffffff
#define eps 1e-8
#define LL long long
#define PI 3.141592654
#define CLR(a,b) memset(a,b,sizeof(a))
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FOR_(i,a,b) for(int i=a;i>=b;i--)
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define ft first
#define sd second
#define sf scanf
#define pf printf
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
#define acfun std::ios::sync_with_stdio(false)

#define SIZE 100 +1
using namespace std;

int n,m;
int g[SIZE][SIZE];
int xx[]={0,0,-1,1};
int yy[]={-1,1,0,0};
int dp[SIZE][SIZE];

int dfs(int i,int j)
{
    if(dp[i][j]>1)return dp[i][j];
    FOR(k,0,4)
    {
        int x=i+xx[k];
        int y=j+yy[k];
        if(x<0||y<0||x>=n||y>=m)continue;
        if(g[x][y]<g[i][j])
            dp[i][j]=max(dp[i][j],dfs(x,y)+1);
    }
    return dp[i][j];
}

int main()
{
    int t;
    sf("%d",&t);
    while(t--)
    {
        char str[SIZE];
        sf("%s%d%d",str,&n,&m);
        FOR(i,0,n)
        FOR(j,0,m)
        sf("%d",&g[i][j]),dp[i][j]=1;

        int ans=0;
        FOR(i,0,n)
        FOR(j,0,m)
         ans=max(ans,dfs(i,j));
        pf("%s: %d\n",str,ans);
    }
}


As an AI language model, I cannot provide you with the exact solution you need without further details. However, here is a general approach to find the longest distance in a binary tree using Python: 1. Define a class for a binary tree node with attributes for the node value, left child, and right child. 2. Define a function that recursively traverses the binary tree and returns the height of the tree starting from a given node. 3. Define a function that recursively traverses the binary tree and returns the longest distance between two nodes in the tree. 4. In the function defined in step 3, for each node, calculate the longest distance that passes through that node and update the maximum distance seen so far. 5. Call the function defined in step 3 starting from the root node of the binary tree. Here is a sample implementation of the above approach: ``` class Node: def __init__(self, value): self.value = value self.left = None self.right = None def height(root): if root is None: return 0 return 1 + max(height(root.left), height(root.right)) def longest_distance(root): if root is None: return 0 left_height = height(root.left) right_height = height(root.right) left_distance = longest_distance(root.left) right_distance = longest_distance(root.right) return max(left_height + right_height, max(left_distance, right_distance)) root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) root.right.left = Node(6) root.right.right = Node(7) print(longest_distance(root)) ``` This code will output the longest distance between any two nodes in the binary tree.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值