Codeforces 5E Bindian Signalizing

標籤：blog   http   get   2014   os   name   

題目連結：點擊開啟連結

#include<stdio.h>#include<iostream>#include<string.h>#include<set>#include<vector>#include<map>#include<math.h>#include<queue>#include<string>#include<stdlib.h>#include<algorithm>using namespace std;#define N 1000005#define ll __int64int n;int a[N],b[N];int sx[N], sy[N];int main(){int i, u, v;while(~scanf("%d",&n)){int maxx = 0;for(i=0;i<n;i++){scanf("%d",&a[i]); if(a[i]>a[maxx])maxx = i;}int dep = 0;for(i=maxx; i<n;i++)b[++dep] = a[i];for(i=0;i<maxx; i++)b[++dep] = a[i];ll ans = 0;int top = 0;for(i = 1; i <= n; i++) {while(top && b[i]>sx[top-1])ans+=sy[--top];if(!top){sx[top] = b[i];sy[top++] = 1;continue;}if(sx[top-1]==b[i]){ans += sy[top-1];sy[top-1]++;if(top>1)ans++;}else {ans++;sx[top] = b[i];sy[top++] = 1;}}while(top>2)ans += sy[--top];if(top==2){top--;if(sy[top-1] > 1)ans+=sy[top];}cout<<ans<<endl;}return 0;}