牛客小白月赛1 G あなたの蛙は旅⽴っています【DP】

本文介绍了一道NowCoder竞赛题目G的解决方案。通过使用动态规划方法来解决该问题,详细展示了数据读取和存储的过程,并给出了完整的AC代码实现。

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

题目链接

https://www.nowcoder.com/acm/contest/85/G

思路

这里写图片描述

按照题解上的方式 存取数据
然后DP一下 就可以了

AC代码

#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <numeric>
#include <sstream>
#include <iomanip>
#include <limits>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const double PI  = 3.14159265358979323846264338327;
const double E   = exp(1);
const double eps = 1e-6;

const int INF    = 0x3f3f3f3f;
const int maxn   = 3e3 + 5;
const int MOD    = 1e9 + 7;

int Map[maxn][maxn], Cur[maxn], dp[maxn][maxn];

int main()
{
    int n;
    scanf("%d", &n);
    memset(Map, 0xc0, sizeof(Map));
    memset(Cur, 0, sizeof(Cur));
    memset(dp, 0, sizeof(dp));
    int vis = 1 + (4 * (n - 1)); 
    int cur = 2 * n - 1;     
    int i, j;
    for (i = 0; i < n; i++)
        Cur[i] = i + 1;
    int opt[2];
    opt[i % 2] = n - 1;
    opt[!(i % 2)] = n;
    int flag = i % 2;;
    for ( ; i < (vis - n); i++, flag = !flag)
        Cur[i] = opt[flag];
    for (j = n ; i < vis; i++, j--)
        Cur[i] = j;
    vector <int> v[vis];
    int temp;
    for (i = 0; i < vis; i++)
    {
        for (j = 0; j < Cur[i]; j++)
        {
            scanf("%d", &temp);
            v[i].push_back(temp);
        }
    }
    int len = cur/2 + 1;
    flag = 0;
    for (i = 0, j = n; i < len; i++, j++)
    {
        for (int l = 0, k = flag; l < j; l++, k++)
        {
            Map[i][l] = v[k][v[k].size() - 1];
            v[k].pop_back();
            if (v[k].size() == 0)
                flag++;
        }
    }
    for (j -= 2; i < cur; i++, j--)
    {
        for (int l = (cur - j), k = flag; l < cur; l++, k++)
        {
            Map[i][l] = v[k][v[k].size() - 1];
            v[k].pop_back();
            if (v[k].size() == 0)
                flag++; 
        }   
    }
    dp[0][0] = Map[0][0];
    for (i = 1; i < cur; i++)
    {
        dp[0][i] = dp[0][i - 1] + Map[0][i];
        dp[i][0] = dp[i - 1][0] + Map[i][0];    
    }   
    for (i = 1; i < cur; i++)
    {
        for (j = 1; j < cur; j++)
            dp[i][j] = max(max(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + Map[i][j];
    }
    cout << dp[cur - 1][cur - 1] << endl;
}
### 关于小白109的信息 目前并未找到关于小白109的具体比信息或题解内容[^5]。然而,可以推测该事可能属于网举办的系列算法竞之一,通常这类比会涉及数据结构、动态规划、图论等经典算法问题。 如果要准备类似的事,可以通过分析其他场次的比题目来提升自己的能力。例如,在小白13中,有一道与二叉树相关的题目,其核心在于处理树的操作以及统计最终的结果[^3]。通过研究此类问题的解决方法,能够帮助理解如何高效地设计算法并优化时间复杂度。 以下是基于已有经验的一个通用解决方案框架用于应对类似场景下的批量更新操作: ```python class TreeNode: def __init__(self, id): self.id = id self.weight = 0 self.children = [] def build_tree(n): nodes = [TreeNode(i) for i in range(1, n + 1)] for node in nodes: if 2 * node.id <= n: node.children.append(nodes[2 * node.id - 1]) if 2 * node.id + 1 <= n: node.children.append(nodes[2 * node.id]) return nodes[0] def apply_operations(root, operations, m): from collections import defaultdict counts = defaultdict(int) def update_subtree(node, delta): stack = [node] while stack: current = stack.pop() current.weight += delta counts[current.weight] += 1 for child in current.children: stack.append(child) def exclude_subtree(node, total_nodes, delta): nonlocal root stack = [(root, False)] # (current_node, visited) subtree_size = set() while stack: current, visited = stack.pop() if not visited and current != node: stack.append((current, True)) for child in current.children: stack.append((child, False)) elif visited or current == node: if current != node: subtree_size.add(current.id) all_ids = {i for i in range(1, total_nodes + 1)} outside_ids = all_ids.difference(subtree_size.union({node.id})) for idx in outside_ids: nodes[idx].weight += delta counts[nodes[idx].weight] += 1 global nodes nodes = {} queue = [root] while queue: curr = queue.pop(0) nodes[curr.id] = curr for c in curr.children: queue.append(c) for operation in operations: op_type, x = operation.split(' ') x = int(x) target_node = nodes.get(x, None) if not target_node: continue if op_type == '1': update_subtree(target_node, 1) elif op_type == '2' and target_node is not None: exclude_subtree(target_node, n, 1) elif op_type == '3': path_to_root = [] temp = target_node while temp: path_to_root.append(temp) if temp.id % 2 == 0: parent_id = temp.id // 2 else: parent_id = (temp.id - 1) // 2 if parent_id >= 1: temp = nodes[parent_id] else: break for p in path_to_root: p.weight += 1 counts[p.weight] += 1 elif op_type == '4': pass # Implement similarly to other cases. result = [counts[i] for i in range(m + 1)] return result ``` 上述代码片段展示了针对特定类型的树形结构及其操作的一种实现方式。尽管它并非直接对应小白109中的具体题目,但它提供了一个可借鉴的设计思路。 ####
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值