bzoj 4780: [Usaco2017 Open]Modern Art 2

4780: [Usaco2017 Open]Modern Art 2

Time Limit: 10 Sec Memory Limit: 128 MB

Description

Having become bored with standard 2-dimensional artwork (and also frustrated at others copying her w

ork), the great bovine artist Picowso has decided to switch to a more minimalist, 1-dimensional styl

e.Although, her paintings can now be described by a 1-dimensional array of colors of length N(1≤N≤

100,000), her painting style remains unchanged: she starts with a blank canvas and layers upon it a

sequence of "rectangles" of paint, which in this 1-dimensional case are simply intervals. Sheuses ea

ch of the colors 1…Nexactly once, although just as before, some colors might end up being completel

y covered up by the end.To Picowso's great dismay, her competitor Moonet seems to have figured out h

ow to copy even these 1-dimensional paintings, using a similar strategy to the preceding problem: Mo

onet will paint a set ofdisjoint intervals, wait for them to dry, then paint another set of disjoint

intervals, and so on.Moonet can only paint at most one interval of each color over the entire proce

ss. Please compute thenumber of such rounds needed for Moonet to copy a given 1-dimensional Picowso

painting.

伟大的牛艺术家皮科沃已经厌倦了标准的二维艺术作品，也在伤心其他人复制她的作品，她决定转向更简约，一维

的风格。尽管如此,她的作品现在可以表示描述颜色的一维数组长度N(1≤N≤100000)，她的绘画风格没有改变:她

以一个空白的画布开始，一次涂色只能涂上连续几个单位的颜料，同样新的颜料可以完全覆盖旧的颜料，每次涂完

要等上1day才能完全干，只有旧颜料干了以后才能用新颜料覆盖。皮科沃十分沮丧的是，她的对手Moonet似乎已经

找到了如何复制这些一维的绘画，使用类似的策略。前面的问题：Moonet会画几组不相交区间，等待他们干，然后

画几组不相交区间，等等。Moonet同一种颜色只能使用一次。请计算该轮Moonet复制一个给定的一维picowso绘画

所需要的时间。

Input

The first line of input contains N, and the next N lines contain an integer in the range 0…N

indicating the color of each cell in the 1-dimensional painting (0 for a blank cell).

第一行为N，画条长度

从第2行至N行每行一个数表示要涂颜色

Output

Please output the minimum number of rounds needed to copy this painting, or -1 if this could not hav

e possibly been an authentic work of Picowso (i.e., if she could not have painted it using a layered

sequence of intervals, one of each color).

输出一个整数表示最少天数。数据若不合法则输出-1

Sample Input

7
0
1
4
5
1
3
3

Sample Output

2
In this example, the interval of color 1 must be painted in an earlier round than the intervals of c
olors 4 and 5, so at least two rounds are needed.

HINT

我们可以记录一下每种颜色最早和最晚出现的地方fst,lst，这样如果有合法答案，那每次覆盖 fst~lst 一定是可行的，然后似乎就可以搞括号序列，维护深度了

但这里有一个问题，就是直接搞的话可能会出错，网上的一些题解也可能忽略了这个问题

可能会有这样一组数据

1 2 2 1 2 2 1

实际输出会是-1，但可能会输出2

所以我们需要扫一遍整个数组，并维护一个栈，当当前点是fst时，我们将他压入栈内，是lst时弹出

但如果既不是fst，也不等于栈顶的颜色的话就无解，因为这个点一定被栈顶颜色所在区间包含

而他对应颜色的区间并不包含与内，所以要想满足，这个点就至少被染色两次

这样就维护栈的最大size就好

#include<map>

#include<cmath>

#include<queue>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

#define inf 1000000007

#define ll long long

#define N 100010

inline int rd()

{

    int x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

int n,c[N],fst[N],lst[N],q[N],tot,mx;

int main()

{

    n=rd();

    for(int i=;i<=n;i++)

    {

        c[i]=rd();

        if(!fst[c[i]]) fst[c[i]]=i;

        lst[c[i]]=i;

    }

    c[n+]=;lst[]=n+;

    for(int i=,x;i<=n+;i++)

    {

        x=c[i];

        if(i==fst[x]) q[++tot]=x,mx=max(tot,mx);

        if(q[tot]!=x){puts("-1");return ;}

        if(i==lst[x]) tot--;

    }

    printf("%d\n",mx-);

    return ;

}