1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int main(){
	ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    VI a(n);
    loop(i,0,n) cin>>a[i];

    map<int, int> tp;
    loop(i,0,n) tp[a[i]] = i;
    set<int> pos;
    ll r=0;
    loopback(i,n,(n-1)/2+1) {
        pos.insert(tp[i]);
        ll b = *pos.begin();
        ll e = *(pos.rbegin());
        ll L = b;
        ll R = n-e-1;

        ll l = e-b+1;
        ll x = n-i+1;

        ll ex1 = 2*x - 2;
        ll d = ex1 - l;
        ll a1 = d + 1 - max(0LL, d-L) - max(0LL, d-R);
        r += max(0LL, a1); 

        ll ex2 = 2*x - 1;
        ll a2 = -1;
        if(ex2 <= n) {
            d = ex2 - l;
            a2 = d + 1 - max(0LL, d-L) - max(0LL, d-R);
            r += max(0LL, a2);
        }
        //ps(i);ps(l);ps(":");ps(2*x-2);ps(a1);ps(";");ps(2*x-2);ps(";");pln(r);
    }    
    ps(2*n+1);pln(r);
}