高速公路[线段树]

传送门   #include<bits/stdc++.h> #define N 100050 #define LL long long #define len(x) (t[x].r-t[x].l+1) using namespace std; struct Node{LL l,r,tag,sum1,sum2,sum3;}t[N<<2]; LL n,m; char s[3]; LL read(){

>>阅读原文<<