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
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n;
int tab[1000007], gdzie[1000007];

pair<int, int> solve()
{
    scanf("%d", &n);
    FOR(i, 1, n)
    {
        scanf("%d", &tab[i]);
        gdzie[tab[i]] = i;
    }
    int pocz = n, kon = 1;
    long long res = 0;
    FOR(dl, 0, n)
    {
        if(dl%2 == 0)
        {
            pocz = min(pocz, gdzie[n-dl/2]);
            kon  = max(kon,  gdzie[n-dl/2]);
        }
        if(kon-pocz+1 <= dl)
        {
            int l = max(kon-dl+1, 1);
            int p = min(n-dl+1, pocz);
            res += p-l+1;
        }
//        cout << "dl: " << dl << ", res: " << res << endl;
    }

    cout << 2*n+1 << " " << res << endl;



    return MP(2*n+1, res);
}

int main()
{/*
    n = 1000000;
    cout << n << endl;
    vector <int> v;
    for(int i=1; i<n; i += 2)
        v.PB(i);
    for(int i=n; i>0; i -= 2)
        v.PB(i);
    FOR(i, 0, n-1)
        cout << v[i] << " ";
    cout << endl;
    return 0;
*/
    auto p = solve();

    return 0;

    srand(time(0));
    forr(x, 1000)
    {
        if(x%100 == 0)
            cout << x << endl;
        n = rand()%100+1;
        FOR(i, 1, n)
            tab[i] = i;
        random_shuffle(tab+1, tab+n+1);
        //FOR(i, 1, n)
        //    cout << tab[i] << " ";
        //cout << endl;
        auto p = solve();
        int res=0, ile=0;
        FOR(pocz, 1, n)
            FOR(kon, pocz, n)
            {
                int dl = kon-pocz+1;
                vector <int> v;
                FOR(i, pocz, kon)
                    v.PB(tab[i]);
                sort(v.begin(), v.end());
                int r = kon-pocz+1 + v[dl/2] + v[(dl-1)/2];
                if(r > res)
                {
                    res = r;
                    ile = 1;
                }
                else if(res == r)
                    ile++;
            }
        if(res != p.ff || ile != p.ss)
        {
            cout << "ZLE!\n";
            FOR(i, 1, n)
                cout << tab[i] << " ";
            cout << endl;
            cout << "mialo byc " << res << " " << ile << endl;
            cout << "jest " << p.ff << " " << p.ss << endl;
        }
        //else
            //cout << "OK\n";
    }
    //solve();

    return 0;
}