Educational Codeforces Round 94 (Rated for Div. 2) E. Clear the Multiset_choose two integers i and x (x≥1 ), then remove x -CSDN博客

本文链接：https://blog.csdn.net/weixin_44354699/article/details/108232162

Title

CodeForces 1400 E. Clear the Multiset

Time Limit

2 seconds

Memory Limit

256 megabytes

Problem Description

You have a multiset containing several integers. Initially, it contains $a_1$ elements equal to $1$ , $a_2$ elements equal to $2$ , …, $a_n$ elements equal to $n$ .

You may apply two types of operations:

choose two integers ll and rr (l≤rl≤r), then remove one occurrence of ll, one occurrence of l+1l+1, …, one occurrence of rr from the multiset. This operation can be applied only if each number from ll to rr occurs at least once in the multiset;
choose two integers ii and xx (x≥1x≥1), then remove xx occurrences of ii from the multiset. This operation can be applied only if the multiset contains at least xx occurrences of ii.

What is the minimum number of operations required to delete all elements from the multiset?

Input

The first line contains one integer $n$ ( $\le n \le 5000$ ).

The second line contains $n$ integers $a_1$ , $a_2$ , …, $a_n$ ( $\le a_i \le 10^9$ ).

Output

Print one integer — the minimum number of operations required to delete all elements from the multiset.

Sample Input

4
1 4 1 1

Sample Onput

Source

CodeForces 1400 E. Clear the Multiset

题意

给出一个1-n的连续区间，其中1有a[1]个,2有a[2]个。

两个操作

选取连续的区间[l,r]，a[l~r]-=1.
选择一个i使得a[i]=0

求全部变0的最小操作。

思路

因为被C卡太久，D没能在赛里做出来。

很自然的想法就是取区间中最小值，然后整个区间-最小值次，因此划分为更多区间，递归即可。

不懂证明。

还有一个点就是别忘了操作2，因为可以只使用操作1比操作2区间逐个拿掉多。

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 3e5 + 5;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
int dfs(vector<int> &a, int l, int r, int mini) {
    if (l > r) return 0;
    if (l == r) return a[l] != mini;
    int pos = min_element(a.begin() + l, a.begin() + r + 1) - a.begin();
    return min(r - l + 1, dfs(a, l, pos - 1, a[pos]) +
                              dfs(a, pos + 1, r, a[pos]) + (a[pos] - mini));
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &it : a) cin >> it;
    cout << dfs(a, 0, n - 1, 0) << endl;
    return 0;
}