【开源社区openEuler实践】D. Fake Plastic Trees

__night_

已于 2025-01-03 15:58:28 修改

阅读量205

点赞数 3

CC 4.0 BY-SA版权

文章标签：算法

于 2024-04-16 17:33:31 首次发布

本文链接：https://blog.youkuaiyun.com/way_back__/article/details/137833499

题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = 1e5;
 const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];
int n, m;
int a[maxn];

string s;

struct Node{
    // int val, id;
    // bool operator<(const Node &u)const{
    //     return val < u.val;//!!!!!!!!!!!!!!!!!!
    // }
    int v,