Educational Codeforces Round 61 C. Painting the Fence

最新推荐文章于 2024-11-05 21:58:11 发布

Cythia-1

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量324

点赞数 5

分类专栏： c++刷题记录文章标签： c语言算法数据结构 c++

本文链接：https://blog.csdn.net/m0_69367351/article/details/139120627

版权

c++刷题记录专栏收录该内容

52 篇文章 0 订阅

订阅专栏

Painting the Fence

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

You have a long fence which consists of $n$ sections. Unfortunately, it is not painted, so you decided to hire $q$ painters to paint it. $i$ -th painter will paint all sections $x$ such that $l_i \le x \le r_i$ .

Unfortunately, you are on a tight budget, so you may hire only $q - 2$ painters. Obviously, only painters you hire will do their work.

You want to maximize the number of painted sections if you choose $q - 2$ painters optimally. A section is considered painted if at least one painter paints it.

Input

The first line contains two integers $n$ and $q$ ( $\le n, q \le 5000$ ) — the number of sections and the number of painters availible for hire, respectively.

Then $q$ lines follow, each describing one of the painters: $i$ -th line contains two integers $l_i$ and $r_i$ ( $\le l_i \le r_i \le n$ ).

Output

Print one integer — maximum number of painted sections if you hire $q - 2$ painters.

Example

$\tt input$
7 5 1 4 4 5 5 6 6 7 3 5
$\tt output$
7

$\tt input$
4 3 1 1 2 2 3 4
$\tt output$
2

$\tt input$
4 4 1 1 2 2 2 3 3 4
$\tt output$
3

Tutorial

由题意得， $n$ 和 $q$ 的范围为 $\le n, q \le 5000$ ，所以可以用 $\mathcal O(n ^ 2)$ 的复杂度解决这个问题

我们可以用一层循环遍历其中一个画家，然后将其画的范围去掉，此时如果去掉第二个画家，只有那些现在被画一次的位置才可能被抹去，此时可以用前缀和计算区间内有多少个这个位置，然后枚举每一个画家，看解雇这个画家后能少画多少位置

此解法时间复杂度为 $\mathcal O(\max(n, q) ^ 2)$

Solution

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, q, ans = 0;
    cin >> n >> q;
    vector<int> left(q), right(q), cnt(n + 1), pre(n + 2);
    for (int i = 0; i < q; ++i) {
        cin >> left[i] >> right[i];
        // --left[i], --right[i];
        for (int j = left[i]; j <= right[i]; ++j) {
            cnt[j]++;
        }
    }
    for (int i = 0; i < q; ++i) {
        int l = left[i], r = right[i], count = 0;
        for (int j = l; j <= r; ++j) {
            cnt[j]--;
        }
        for (int j = 0; j <= n; ++j) {
            pre[j + 1] = pre[j];
            if (cnt[j] >= 1) {
                count++;
            }
            pre[j + 1] += cnt[j] == 1;
        }
        for (int j = 0; j < i; ++j) {
            ans = max(ans, count - (pre[right[j] + 1] - pre[left[j]]));
        }
        for (int j = l; j <= r; ++j) {
            cnt[j]++;
        }
    }
    cout << ans << endl;
    return 0;
}