Educational Codeforces Round 98 (Rated for Div. 2) E. Two Editorials

最新推荐文章于 2021-05-29 19:34:28 发布

_sky123_

最新推荐文章于 2021-05-29 19:34:28 发布

阅读量386

点赞数

分类专栏： # 枚举

本文链接：https://blog.csdn.net/qq_45323960/article/details/110729439

版权

枚举专栏收录该内容

22 篇文章 0 订阅

订阅专栏

题目链接
Berland regional ICPC contest has just ended. There were $m$ participants numbered from $1$ to $m$ , who competed on a problemset of $n$ problems numbered from $1$ to $n$ . Now the editorial is about to take place. There are two problem authors, each of them is going to tell the tutorial to exactly $k$ consecutive tasks of the problemset. The authors choose the segment of $k$ consecutive tasks for themselves independently of each other. The segments can coincide, intersect or not intersect at all. The $i$ -th participant is interested in listening to the tutorial of all consecutive tasks from $l_i$ to $r_i$ . Each participant always chooses to listen to only the problem author that tells the tutorials to the maximum number of tasks he is interested in. Let this maximum number be $a_i$ . No participant can listen to both of the authors, even if their segments don’t intersect. The authors want to choose the segments of $k$ consecutive tasks for themselves in such a way that the sum of $a_i$ over all participants is maximized. Input
The first line contains three integers $n, m$ and $k$ ( $\le n, m \le 2000$ , $\le k \le n$ ) — the number of problems, the number of participants and the length of the segment of tasks each of the problem authors plans to tell the tutorial to. The $i$ -th of the next $m$ lines contains two integers $l_i$ and $r_i$ ( $\le l_i \le r_i \le n$ ) — the segment of tasks the $i$ -th participant is interested in listening to the tutorial to. Output
Print a single integer — the maximum sum of $a_i$ over all participants. Examples
input

output

input

output

input

output

input

output

Note
In the first example the first author can tell the tutorial to problems from $1$ to $3$ and the second one — from $6$ to $8$ . That way the sequence of $a_i$ will be $[3, 2, 3, 3, 3]$ . Notice that the last participant can’t listen to both author, he only chooses the one that tells the maximum number of problems he’s interested in. In the second example the first one can tell problems $2$ to $4$ , the second one — $4$ to $6$ . In the third example the first one can tell problems $1$ to $1$ , the second one — $2$ to $2$ . Or $4$ to $4$ and $3$ to $3$ . Every pair of different problems will get the same sum of $2$ . In the fourth example the first one can tell problems $1$ to $5$ , the second one — $1$ to $5$ as well.
在这里插入图片描述

如图所示，这是某参与者选择两各时间段均可的情况。显然，当某参与者与两个时间段都有交集的时候，该参与者的时间段的中点与哪个时间段更近则更应该选择哪个时间段。因为最优情况一定是中点靠后的在后一个时间段，中点靠前的在前一个时间段，因此考虑枚举参与者参加前一段和后一段的分界线，首先将所有参与者的时间段按照中点排序，然后暴力 $O (n m)$ 求出后 $m - i + 1$ 个参与者在只有一个时间段的情况下最大的总人次 $s u m 1 [i]$ 。同理可求出求前 $i$ 个参与者在只有一个时间段的情况下最大的总人次 $s u m 2 [i]$ 。最终的答案为 $\max\limits_{i=1}^m(sum1[i]+sum2[i+1])$ 。时间复杂度为 $O(n\log n+nm)$ 。

#include<bits/stdc++.h>

using namespace std;

inline int qr() {
    int f = 0, fu = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-')fu = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        f = (f << 3) + (f << 1) + c - 48;
        c = getchar();
    }
    return f * fu;
}

const int N = 2e3 + 10;
int n, m, k;

struct node {
    int l, r;

    inline bool operator<(node a) const {
        return l + r < a.l + a.r;
    }
} a[N];

int sum[N];

int main() {
    n = qr(), m = qr(), k = qr();
    for (int i = 1; i <= m; ++i)a[i].l = qr(), a[i].r = qr();
    sort(a + 1, a + 1 + m);
    for (int l = 1; l <= n - k + 1; ++l) {
        int r = l + k - 1;
        int cur = 0;
        for (int i = m; i >= 1; --i) {
            cur += max(0, min(r, a[i].r) - max(l, a[i].l) + 1);
            sum[i] = max(sum[i], cur);
        }
    }
    int ans = 0;
    for (int l = 1; l <= n - k + 1; ++l) {
        int r = l + k - 1;
        int cur = 0;
        for (int i = 1; i <= m; ++i) {
            cur += max(0, min(r, a[i].r) - max(l, a[i].l) + 1);
            ans = max(ans, cur + sum[i + 1]);
        }
    }
    printf("%d\n", ans);
    return 0;
}