#include <iostream>
using namespace std;
#define MAXL 1000000
int Order[MAXL + 10], n;
struct node {
int l, r;
int len;
node* left;
node* right;
};
node C[MAXL * 2 + 100];
int c = 0;
int Result[MAXL + 10];
void Build_tr
Difficult Lost Cows 线段树
最新推荐文章于 2025-06-28 21:30:00 发布