# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1159036 | Mingyuanz | Bubble Sort 2 (JOI18_bubblesort2) | C++20 | 0 ms | 0 KiB |
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define INF (int)9e18
#define MOD (int)(1e9+7)
#define MAXN 500069
#define enl '\n'
#define DB(CODE) cout<<'\t'<<CODE<<'\n';
#define SP <<' '<<
//#define int long long
typedef long long ll;
using namespace std;
struct node{
int mx;
int add;
};
int n,q,N;
node seg[6*MAXN];
node createnode(int val){
node nd;
nd.mx=val;
nd.add=0;
return nd;
}
node mergenode(node left,node right){
node nd;
nd.mx=max(left.mx,right.mx);
nd.add=0;
return nd;