結果
| 問題 |
No.3198 Monotonic Query
|
| ユーザー |
 伟国姚
|
| 提出日時 | 2025-07-11 21:36:38 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 543 ms / 3,000 ms |
| コード長 | 6,746 bytes |
| コンパイル時間 | 5,152 ms |
| コンパイル使用メモリ | 81,948 KB |
| 実行使用メモリ | 72,948 KB |
| 最終ジャッジ日時 | 2025-07-12 10:52:41 |
| 合計ジャッジ時間 | 17,740 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static void init(int n) {
int len = 4 * n;
lazy = new int[len];
coordination = new int[n];
sum = new long[len];
max = new long[len];
min = new long[len];
build(1, 0, n - 1);//默认根节点编号为 1，区间左端点为 0 ，右端点为 n - 1
}
static void build(int u, int le, int ri) {
if (le == ri) {
coordination[le] = u;
return;
}
int mid = le + ri >> 1;
build(u << 1, le, mid);
build(u << 1 | 1, mid + 1, ri);
pushUp(u);
}
static void init(int n, int[] a) {
int len = 4 * n;
lazy = new int[len];
coordination = new int[len];
sum = new long[len];
max = new long[len];
min = new long[len];
build(1, 0, n - 1, a);//默认根节点编号为 1，区间左端点为 0 ，右端点为 n - 1
}
static void build(int u, int le, int ri, int[] a) {
if (le == ri) {
coordination[le] = u;
sum[u] = max[u] = min[u] = a[le];
return;
}
int mid = le + ri >> 1;
build(u << 1, le, mid, a);
build(u << 1 | 1, mid + 1, ri, a);
pushUp(u);
}
//子节点信息更新父节点信息
static void pushUp(int u) {
max[u] = Math.max(max[u << 1], max[u << 1 | 1]);
min[u] = Math.min(min[u << 1], min[u << 1 | 1]);
sum[u] = sum[u << 1] + sum[u << 1 | 1];
}
//下传懒标记
static void pushDown(int u, int l, int r) {
if (lazy[u] == 0) return;
int mid = l + r >> 1;
pd(u << 1, lazy[u], l, mid);
pd(u << 1 | 1, lazy[u], mid + 1, r);
lazy[u] = 0;
}
static void pd(int u, int lz, int l, int r) {
sum[u] += lz * (r - l + 1);
lazy[u] += lz;
max[u] += lz;
min[u] += lz;
}
//区间修改 区间 + v
static void updateRange(int u, int le, int ri, int v, int l, int r) {
if (le <= l && r <= ri) {//完全覆盖
pd(u, v, l, r);
return;
}
pushDown(u, l, r);
int mid = l + r >> 1;
if (mid >= le) updateRange(u << 1, le, ri, v, l, mid);
if (mid < ri) updateRange(u << 1 | 1, le, ri, v, mid + 1, r);
pushUp(u);
}
//单点修改,将下标 idx 处的值加上 v
static void update(int u, int idx, int v, int l, int r) {
if (l == idx && r == idx) {
pd(u, v, l, r);
return;
}
pushDown(u, l, r);
int mid = l + r >> 1;
if (mid >= idx) update(u << 1, idx, v, l, mid);
else update(u << 1 | 1, idx, v, mid + 1, r);
pushUp(u);
}
//单点修改,将下标 idx 处的值变成 v
static void update1(int u, int idx, int v, int l, int r) {
if (l == idx && r == idx) {
sum[u] = max[u] = min[u] = v;
return;
}
pushDown(u, l, r);
int mid = l + r >> 1;
if (mid >= idx) update1(u << 1, idx, v, l, mid);
else update1(u << 1 | 1, idx, v, mid + 1, r);
pushUp(u);
}
//单点查询
static long querySingle(int u, int x, int l, int r) {
if (l == x && r == x) return sum[u];
pushDown(u, l, r);
int mid = l + r >> 1;
if (mid >= x) return querySingle(u << 1, x, l, mid);
else return querySingle(u << 1 | 1, x, mid + 1, r);
}
//区间和查询
static long queryRangeSum(int u, int le, int ri, int l, int r) {
if (le <= l && r <= ri) {//完全覆盖
return sum[u];
}
pushDown(u, l, r);
int mid = l + r >> 1;
long ret = 0;
if (mid >= le) ret += queryRangeSum(u << 1, le, ri, l, mid);
if (mid < ri) ret += queryRangeSum(u << 1 | 1, le, ri, mid + 1, r);
return ret;
}
//区间最大值查询
static long queryRangeMax(int u, int le, int ri, int l, int r) {
if (le <= l && r <= ri) {//完全覆盖
return max[u];
}
pushDown(u, l, r);
int mid = l + r >> 1;
long ret = Long.MIN_VALUE;
if (mid >= le) ret = Math.max(ret, queryRangeMax(u << 1, le, ri, l, mid));
if (mid < ri) ret = Math.max(ret, queryRangeMax(u << 1 | 1, le, ri, mid + 1, r));
return ret;
}
//区间最小值查询
static long queryRangeMin(int u, int le, int ri, int l, int r) {
if (le <= l && r <= ri) {//完全覆盖
return min[u];
}
pushDown(u, l, r);
int mid = l + r >> 1;
long ret = Long.MAX_VALUE;
if (mid >= le) ret = Math.min(ret, queryRangeMin(u << 1, le, ri, l, mid));
if (mid < ri) ret = Math.min(ret, queryRangeMin(u << 1 | 1, le, ri, mid + 1, r));
return ret;
}
//查询当前情况
static void look(int n) {
for (int i = 0; i < n; i++) {
System.out.print(querySingle(1, i, 0, n - 1) + " ");
}
System.out.println();
}
static int[] coordination;//coordination[i] = j 表示数组元素 a[i] 在线段树中的叶子编号为 j
static int[] lazy;
static long[] sum, max, min;
public static void main(String[] args) {
int N = (int) 2e5 + 5;
init(N);
int n = sc.nextInt();
int pt = -1;
for (int i = 0; i < n; i++) {
int t = sc.nextInt(), x = sc.nextInt();
if (t == 1) {
pt++;
update(1, pt, x, 0, N - 1);
} else {
//[0,pt]
//[pt-k+1,pt]
long l = queryRangeMax(1, pt - x + 1, pt, 0, N - 1);
out.println(l);
}
}
out.close();
}
static Kattio sc = new Kattio();
static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static class Kattio {
static BufferedReader r;
static StringTokenizer st;
public Kattio() {
r = new BufferedReader(new InputStreamReader(System.in));
}
public String next() {
try {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(r.readLine());
}
return st.nextToken();
} catch (Exception e) {
return null;
}
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
}