新华三开奖

链接 不想说了,典型的线段树,之前已经写过,就不赘述了 #include<iostream> #include<vector> #include<algorithm> #include<climits> using namespace std; class node { public: vector<int>tree; vector<int>lazy; int n; void build(vector<int>& data, int left, int right, int root) { if (le...