线段树模板
POJ:A Simple Problem with Integers
#include <iostream>
#define ll long long
using namespace std;
const int maxn = 100010;
ll data[maxn];
struct Node {
int l, r;
ll tag, val;
}nodes[maxn * 4];
void push_down(int id) {
Node &cur = nod
原创
2022-03-20 23:01:20 ·
194 阅读 ·
0 评论