题目:BZOJ 1609:[Usaco2008 Feb]Eating Together麻烦的聚餐
思路:做两遍单调队列,一遍单调不上升,一遍单调不下降就好了。
附上代码:
#include<bits/stdc++.h>
using namespace std;
int mid,n,l=1,ans=0,r=0,ans2;
int a[100000],b[100000];
int read()
{
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main()
{
n=read();
for(int i=1;i<=n;i++)
a[i]=read();
for(int i=1;i<=n;i++)
{
l=1;r=ans;
while(l<=r)
{
mid=(l+r)>>1;
if(b[mid]<=a[i])l=mid+1;
else r=mid-1;
}
if(l>ans)
{
++ans;
b[ans]=a[i];
}
else b[l]=a[i];
}
ans2=n-ans,ans=0;
for(int i=1;i<=n;i++)
b[i]=0;
for(int i=1;i<=n;i++)
{
l=1;r=ans;
while(l<=r)
{
mid=(l+r)>>1;
if(b[mid]<a[i])r=mid-1;
else l=mid+1;
}
if(l>ans)
{
++ans;
b[ans]=a[i];
}
else b[l]=a[i];
}
if(n-ans<ans2)ans2=n-ans;
printf("%d",ans2);
return 0;
}