【9018p1308】音乐会的等待

#include<iostream>
#include<cstdio>
using namespace std;
int n,st[500001],t,top=1;
long long ans;
int main(){
	scanf("%d%d",&n,&st[1]);
	for(int i=2;i<=n;i++){
		scanf("%d",&t);
		if(t<st[top]){
			ans++;st[++top]=t;
		}
		else{
			int l=1,r=top;
			while(l<r){
				int m=(l+r)>>1;
				if(r==l+1)m=r;
				if(st[m]>t)l=m;
				else r=m-1;
			}
			ans+=top-l+1;
			while(top>0&&st[top]<t)top--;
			st[++top]=t;
		}
	}
	printf("%lld",ans);
	return 0;
}

http://218.5.5.242:9018/JudgeOnline/problem.php?id=1308