Codeforces Round #675 (Div. 2) 1442 F - Boring Queries 可持久化線段樹維護 區間乘法

  #include <bits/stdc++.h> using namespace std; typedef long long ll; #define re register #define pb push_back typedef pair<int,int> pii; const double PI= acos(-1.0); const int M = 2e5+7; const int mo

>>阅读原文<<