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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <string>
#include <stdint.h>
#include <unordered_set>
#include <algorithm>
#include <vector>
#include <functional>


using namespace std;


struct Number
{
    int32_t iPos;
};


struct Segment
{
    int32_t iMinPos;
    int32_t iMaxPos;

    int32_t GetSize() const
    {
        return iMaxPos - iMinPos + 1;
    }

    void Init(int32_t iPos)
    {
        iMinPos = iPos;
        iMaxPos = iPos;
    }

    void Init(int32_t iPos0, int32_t iPos1)
    {
        iMinPos = min(iPos0, iPos1);
        iMaxPos = max(iPos0, iPos1);
    }

    void Extend(int32_t iPos)
    {
        if (iPos > iMaxPos)
        {
            iMaxPos = iPos;
        }

        if (iPos < iMinPos)
        {
            iMinPos = iPos;
        }
    }
};


static int32_t iN;

static int64_t iSolutionCnt;

static Number aNums[1000002];


static void ReadData()
{
    int32_t k;

    cin >> iN;

    for (int i = 0; i < iN; ++i)
    {
        cin >> k;

        aNums[k].iPos = i;
    }
}


static inline int32_t GetNumOfPossibilities(const Segment & sePotentialLocation, const Segment & sePositionsOfHigherNums, int32_t iSegmentSize)
{
    int32_t x = sePotentialLocation.GetSize() - iSegmentSize + 1;

    int32_t y = iSegmentSize - sePositionsOfHigherNums.GetSize() + 1;

    return min(x, y);
}


static void SolveOdd()
{
    int32_t iNum = iN;
    int32_t iSegmentRadius = 0;
    int32_t iSegmSize = 1;

    Segment sePositionsOfHigherNums, sePotentialLocation;
    
    sePositionsOfHigherNums.Init(aNums[iN].iPos);

    for (;;)
    {
        iSegmSize += 2;
        iSegmentRadius++;

        if (iSegmSize > iN)
            break;

        iNum--;

        int32_t iPos = aNums[iNum].iPos;

        sePositionsOfHigherNums.Extend(iPos);

        if (sePositionsOfHigherNums.GetSize() > iSegmSize)
            continue;

        sePotentialLocation.iMinPos = max(sePositionsOfHigherNums.iMaxPos - 2 * iSegmentRadius, 0);
        sePotentialLocation.iMaxPos = min(sePositionsOfHigherNums.iMinPos + 2 * iSegmentRadius, iN - 1);

        if (sePositionsOfHigherNums.iMaxPos <= sePotentialLocation.iMaxPos &&
            sePositionsOfHigherNums.iMinPos >= sePotentialLocation.iMinPos)
        {
            iSolutionCnt += GetNumOfPossibilities(sePotentialLocation, sePositionsOfHigherNums, iSegmSize);
        }
    }
}


static void SolveEven()
{
    if (iN < 2)
        return;

    int32_t iNum = iN - 1;
    int32_t iSegmentRadius = 0;
    int32_t iSegmSize = 2;

    Segment sePositionsOfHigherNums, sePotentialLocation;

    sePositionsOfHigherNums.Init(aNums[iN].iPos, aNums[iN - 1].iPos);

    if (sePositionsOfHigherNums.GetSize() == 2)
    {
        iSolutionCnt++;
    }

    for (;;)
    {
        iSegmSize += 2;
        iSegmentRadius++;

        if (iSegmSize > iN)
            break;

        iNum--;

        int32_t iPos = aNums[iNum].iPos;

        sePositionsOfHigherNums.Extend(iPos);

        if (sePositionsOfHigherNums.GetSize() > iSegmSize)
            continue;

        sePotentialLocation.iMinPos = max(sePositionsOfHigherNums.iMaxPos - 2 * iSegmentRadius - 1, 0);
        sePotentialLocation.iMaxPos = min(sePositionsOfHigherNums.iMinPos + 2 * iSegmentRadius + 1, iN - 1);

        if (sePositionsOfHigherNums.iMaxPos <= sePotentialLocation.iMaxPos &&
            sePositionsOfHigherNums.iMinPos >= sePotentialLocation.iMinPos)
        {
            iSolutionCnt += GetNumOfPossibilities(sePotentialLocation, sePositionsOfHigherNums, iSegmSize);
        }
    }
}


int main(int argc, char * argv[])
{
    ReadData();

    iSolutionCnt = 1;

    SolveOdd();
    SolveEven();

    cout << iN * 2 + 1 << " " << iSolutionCnt;

    return 0;
}