P1198 [JSOI2008]最大數 線段樹入門

#include <bits/stdc++.h> #define ll long long const int maxn = 200005; using namespace std; ll mod; struct N{ ll val,mx; }no[maxn<<2]; void build(int p,int l,int r){ no[p].val = -1e18; no[p].mx = -

>>阅读原文<<