CodeForces_1400E Clear the Multiset(分治)

Clear the Multiset

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 $l$ and $r$ ($l\le r$), then remove one occurrence of $l$, one occurrence of $l+1$, …, one occurrence of $r$ from the multiset. This operation can be applied only if each number from $l$ to $r$ occurs at least once in the multiset;
• choose two integers $i$ and $x$ ($x\ge 1$), then remove $x$ occurrences of $i$ from the multiset. This operation can be applied only if the multiset contains at least $x$ occurrences of $i$.

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

Input

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

The second line contains n integers $a_1$, $a_2$, …, $a_n$ ($0\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 Output

2

题意

有一个多重集，其中值为$i$的数字有$a_i$个$(1\le i\le n)$。可以进行两种操作：

• 选择两个数$l$，$r(l\le r)$，从集合删除值为$l$到$r$的各删除一个。需保证$l$到$r$中每种值至少有一个。
• 选择两个数$i,x$，从集合中删除$x$个值为$i$的数。需保证当前集合中值为$i$的数至少有$x$个。

求最少的操作次数使集合为空。

题解

只考虑操作2，所以最多需要n次操作。
设$mi=min(a_1,a_2,...,a_n)$.若要执行操作1，则一定是执行mi次$l=1,r=n$(若少于mi次，则实际上还是需要n次操作2，若多于mi次，则不符合条件)。
执行mi次操作后，剩下的$a_i>mi$的则被分成若干段连续区间。对于每一段区间，递归处理，考虑其只需要使用操作2，或需要若干次操作1的最小操作数使集合为空。

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#define dbg(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define eps 1e-8
   
using namespace std;
typedef long long LL;  
typedef pair<int, int> P;
const int maxn = 5020;
const int mod = 1000000007;
int a[maxn];
int dfs(int l, int r, int up);

int main()
{
    int n, m, i, j, k;
    scanf("%d", &n);
    for(i=1;i<=n;i++)
        scanf("%d", &a[i]);
    printf("%d", dfs(1, n, 0));
    return 0;
}

int dfs(int l, int r, int up)
{
    int mi = INF, i, j, sum;
    for(i=l;i<=r;i++)
        if(a[i] < mi)mi = a[i];
    sum = mi-up, i = l;
    while(i<=r){
        if(a[i]>mi){
            j=i;
            while(a[j]>mi && j<=r)
                j++;
            sum += dfs(i, j-1, mi);
            i = j;
        }
        else i++;
    }
    return min(sum, r-l+1);
}