Problem code: FRBSUM
定义一个多重集S的ForbiddenSum为,不能表示为S的某个子集中所有元素之和的最小元素。比如,多重集 {1, 1, 3, 7}的ForbiddenSum为6。
给定长度为n的序列a,有m次询问,每次给定li 和ri ,询问多重集 S = { al, al+1,……,ar } 的ForbiddenSum。
n, m <= 100000, ∑ai <= 10 ^ 9
思路:暴力是将这段排序,一个一个往里加,直到有断开为止。我们考虑加了前i个sum[i],下一次我们可以不只加第i+1个,而是将小于sum[i]的都加入,我们发现这样就不用排序,而是可持久化线段树就能做了。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define u t[x]
#define v t[y]
using namespace std;
typedef long long LL;
const int N = 100005;
struct arr { int l, r, lc, rc, vl; } t[N*55];
int n, m, tz, Q, a[N], b[N], T[N], sum;
int Build(int l, int r) {
int x = ++ tz; u.l = l, u.r = r;
if (l == r) return x;
int mid = (l + r) >> 1;
u.lc = Build(l, mid), u.rc = Build(mid+1, r);
return x;
}
int Add(int tx, int y) {
int x = ++ tz;
u = t[tx], u.vl += b[y];
if (u.l == u.r) return x;
int mid = (u.l + u.r) >> 1;
if (y <= mid) u.lc = Add(t[tx].lc, y);
else u.rc = Add(t[tx].rc, y);
return x;
}
int Qry(int x, int y) {
if (b[u.l] > sum + 1) return 0;
if (b[u.r] <= sum + 1) return u.vl - v.vl;
return Qry(u.lc, v.lc) + Qry(u.rc, v.rc);
}
int main()
{
scanf ("%d", &n);
Rep(i, 1, n)
scanf ("%d", &a[i]), b[i] = a[i];
sort (b+1, b+n+1);
m = unique(b+1, b+n+1) - b - 1;
T[n+1] = Build(1, m);
for (int i = n; i >= 1; i --) {
int pos = lower_bound(b+1, b+m+1, a[i]) - b;
T[i] = Add(T[i+1], pos);
}
scanf ("%d", &Q);
while (Q --) {
int l, r, w = 0;
scanf ("%d%d", &l, &r);
for (sum = 0; (w = Qry(T[l], T[r+1])) && sum < w; ) sum = w;
printf ("%d\n", sum + 1);
}
return 0;
}