【bzoj3126】[Usaco2013 Open]Photo 单调队列

Description

Farmer John has decided to assemble a panoramic photo of a lineup of his N cows (1 <= N <= 200,000), which, as always, are conveniently numbered from 1..N. Accordingly, he snapped M (1 <= M <= 100,000) photos, each covering a contiguous range of cows: photo i contains cows a_i through b_i inclusive. The photos collectively may not necessarily cover every single cow. After taking his photos, FJ notices a very interesting phenomenon: each photo he took contains exactly one cow with spots! FJ was aware that he had some number of spotted cows in his herd, but he had never actually counted them. Based on his photos, please determine the maximum possible number of spotted cows that could exist in his herd. Output -1 if there is no possible assignment of spots to cows consistent with FJ’s photographic results.

给你一个n长度的数轴和m个区间，每个区间里有且仅有一个点，问能有多少个点

Input

• Line 1: Two integers N and M.

  • Lines 2..M+1: Line i+1 contains a_i and b_i.

Output

• Line 1: The maximum possible number of spotted cows on FJ’s farm, or -1 if there is no possible solution.

Sample Input

5 3

1 4

2 5

3 4

INPUT DETAILS: There are 5 cows and 3 photos. The first photo contains cows 1 through 4, etc.
Sample Output

1

OUTPUT DETAILS: From the last photo, we know that either cow 3 or cow 4 must be spotted. By choosing either of these, we satisfy the first two photos as well.

题解
f[i]表示i这个点必须放所能放的最多点数。
f[i]=max(f[j])+1
发现j只能从一段区间l,r转移，且这段区间随着j增大单调向右移动，单调队列维护即可。

代码

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
#include<complex>
#define ll long long
#define mod 10000007
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m,l[200005],r[200005],f[200005],q[200005];
int main()
{
    n=read();m=read();
    for (int i=1;i<=n+1;i++) r[i]=i-1;
    for (int i=1;i<=m;i++)
    {
        int x=read(),y=read();
        r[y]=min(r[y],x-1);
        l[y+1]=max(l[y+1],x);
    }
    for (int i=n;i>=1;i--) r[i]=min(r[i],r[i+1]);
    for (int i=2;i<=n+1;i++) l[i]=max(l[i],l[i-1]);
    int j=1,Head=1,tail=1;
    for (int i=1;i<=n+1;i++)
    {
        while (j<=r[i]&&j<=n)
        {
            if (f[j]==-1){j++;continue;}
            while (f[j]>f[q[tail]]&&Head<=tail) tail--;
            q[++tail]=j++;
        }
        while (q[Head]<l[i]&&Head<=tail) Head++;
        if (Head<=tail) f[i]=f[q[Head]]+(i!=n+1?1:0);
        else f[i]=-1;
    }
    cout<<f[n+1];
    return 0;
}