区间交 HDU - 5700 权值线段树 | 树状数组 二分

题解

将区间按照左端点排序 最开始将前k-1个区间的右端点加入权值线段数
遍历剩下的区间每次把当前区间右端点加入权值线段数并查询倒数第k大的右端点
每次遍历的左端点 到 倒数第k大的右端点的区间则为当前最大区间 使用前缀和求区间和

AC代码

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
ll s[MAXN];

struct node
{
	int l, r, v;
}tre[MAXN * 4];
struct node2
{
    int l, r;
    bool operator < (const node2 &oth)
    {
        return l < oth.l;
    }
}a[MAXN];
void Build(int x, int l, int r)
{
	tre[x].l = l, tre[x].r = r, tre[x].v = 0;
	if (l == r)
		return;
	else
	{
		int m = l + r >> 1;
		Build(x << 1, l, m);
		Build(x << 1 | 1, m + 1, r);
	}
}
void Update(int x, int v, int k)
{
	int l = tre[x].l, r = tre[x].r;
	tre[x].v += k;
	if (l == r)
		return;
	int m = l + r >> 1;
	if (v <= m)
		Update(x << 1, v, k);
	else
		Update(x << 1 | 1, v, k);
}
int Kth(int x, int k) //返回全局倒数第k大
{
	int l = tre[x].l, r = tre[x].r;
	if (l == r)
		return l;
	int m = l + r >> 1;
	if (tre[x << 1 | 1].v >= k) //反
		return Kth(x << 1 | 1, k);
	return Kth(x << 1, k - tre[x << 1 | 1].v);
}
int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
    int N, K, M;
    while (cin >> N >> K >> M)
    {
        for (int i = 1; i <= N; i++) //数值前缀和
            scanf("%lld", &s[i]), s[i] += s[i - 1];
        for (int i = 1; i <= M; i++)
            scanf("%d%d", &a[i].l , &a[i].r);
        sort(a + 1, a + M + 1); //按照l排序
        Build(1, 1, N);
        for (int i = 1; i < K; i++) //先把前k-1加入线段树
            Update(1, a[i].r, 1);
        ll ans = 0;
        for (int i = K; i <= M; i++)
        {
            Update(1, a[i].r, 1);
            int r = Kth(1, K); //倒数第k大的右端点
            ans = max(ans, s[r] - s[a[i].l - 1]);
        }
        cout << ans << endl;
    }

	return 0;
}

树状数组+二分

树桩数组存后缀和 如果后缀和大于等于K则说明覆盖了K次

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
ll s[MAXN];
int c[MAXN];

struct node
{
    int l, r;
    bool operator < (const node &oth) const
    {
        return l < oth.l;
    }
}a[MAXN];
inline int Lowbit(int x)
{
    return x & -x;
}
void Add(int x, int v, int n)
{
    x = n - x + 1;
    while (x <= n)
        c[x] += v, x += Lowbit(x);
}
int Ask(int x, int n)
{
    x = n - x + 1;
    int res = 0;
    while (x)
        res += c[x], x -= Lowbit(x);
    return res;
}
int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
    int N, K, M;
    while (cin >> N >> K >> M)
    {
        memset(c, 0, sizeof(c));
        for (int i = 1; i <= N; i++)
            scanf("%lld", &s[i]), s[i] += s[i - 1];
        for (int i = 1; i <= M; i++)
            scanf("%d%d", &a[i].l, &a[i].r);
        sort(a + 1, a + M + 1); //按照l排序
        ll ans = 0;
        for (int i = 1; i <= M; i++)
        {
            Add(a[i].r, 1, N); //标记右端点
            int l = 1, r = N, m;
            while (l <= r)
            {
                m = l + r >> 1;
                if (Ask(m, N) >= K) //如果后缀和大于等于K则说明覆盖了K次
                    l = m + 1, ans = max(ans, s[m] - s[a[i].l - 1]);
                else
                    r = m - 1;
            }
        }
        cout << ans << endl;
    }

	return 0;
}