BZOJ 4129 Haruna’s Breakfast
同糖果公园,直接树分块套带修莫队即可。#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
const int maxn = 505000;
vector<int> f[maxn],g[maxn];
原创
2017-04-20 09:54:56 ·
354 阅读 ·
0 评论