Pagini recente » Borderou de evaluare (job #2047925) | Borderou de evaluare (job #860874) | Borderou de evaluare (job #1995423) | Cod sursa (job #879738) | Cod sursa (job #3156159)
#include <bits/stdc++.h>
using namespace std;
const string taskname("aimi");
ifstream fin(taskname + ".in");
ofstream fout(taskname + ".out");
const int Inf = 1e9;
struct SegTree {
int n;
vector<int> sgt;
vector<int> lazy;
void init(int _n) {
n = _n;
sgt = vector<int> (4 * n + 5, Inf);
lazy = vector<int> (4 * n + 5, -1);
}
void
void update(int x, int l, int r, int ql, int qr, int val) {
if (l > ql || r < ql)
return;
if (ql <= l && r <= qr) {
}
}
};