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
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define FOR(x, b, e) for(long x = b; x <= (e); x++)
#define FORD(x, b, e) for(long x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)
#define LL long long

using namespace std;

LL r[1100000];
LL n;

long where[1100000];
long calculate()
{
    FOR(i,1,n) where[r[i]]=i;
    long left=where[n]; long right=left;
    long possi=1; long d=1;
    FORD(k,n-1,1)
    {
        if (where[k]<left) left=where[k];
        if (where[k]>right) right=where[k];
        long distance=right-left+1;
        FOR(q,1,2)
        {
            d++; if (d>n) return possi;
            long pl=right-d+1; if (pl<1) pl=1;
            long pr=left; if (pr>n-d+1) pr=n-d+1;
            if (pl<=pr) possi+=pr-pl+1;
        }
    }
    return possi;
}

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
	cin >> n;
	FOR(i,1,n) cin >> r[i];
	cout << n*2+1 << " " << calculate() << "\n";
    return 0;
};