Codeforces Round #527 (Div. 3) D2. Great Vova Wall (Version 2) 【思维】

传送门：http://codeforces.com/contest/1092/problem/D2

D2. Great Vova Wall (Version 2)

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vova's family is building the Great Vova Wall (named by Vova himself). Vova's parents, grandparents, grand-grandparents contributed to it. Now it's totally up to Vova to put the finishing touches.

The current state of the wall can be respresented by a sequence aa of nn integers, with aiai being the height of the ii-th part of the wall.

Vova can only use 2×12×1 bricks to put in the wall (he has infinite supply of them, however).

Vova can put bricks only horizontally on the neighbouring parts of the wall of equal height. It means that if for some ii the current height of part ii is the same as for part i+1i+1, then Vova can put a brick there and thus increase both heights by 1. Obviously, Vova can't put bricks in such a way that its parts turn out to be off the borders (to the left of part 11 of the wall or to the right of part nn of it).

Note that Vova can't put bricks vertically.

Vova is a perfectionist, so he considers the wall completed when:

• all parts of the wall has the same height;
• the wall has no empty spaces inside it.

Can Vova complete the wall using any amount of bricks (possibly zero)?

Input

The first line contains a single integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of parts in the wall.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the initial heights of the parts of the wall.

Output

Print "YES" if Vova can complete the wall using any amount of bricks (possibly zero).

Print "NO" otherwise.

Examples

input

Copy

5
2 1 1 2 5

output

Copy

YES

input

Copy

3
4 5 3

output

Copy

NO

input

Copy

2
10 10

output

Copy

YES

Note

In the first example Vova can put a brick on parts 2 and 3 to make the wall [2,2,2,2,5][2,2,2,2,5] and then put 3 bricks on parts 1 and 2 and 3 bricks on parts 3 and 4 to make it [5,5,5,5,5][5,5,5,5,5].

In the second example Vova can put no bricks in the wall.

In the third example the wall is already complete.

题意概括：

给出 N 个墙的高度，只能用 2*1 的方块去填，判断是否能把所有的墙变成同一高度。

解题思路：

按顺序遍历，只有当两个相邻的墙高度相同时才能相互抵消。

细节就是如果出现有一个超长的墙出现阻隔，需要进行判断这个超长的墙是否在端点，如果在端点则没有影响，如果在中间则有影响。

AC code：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define INF 0x3f3f3f3f
#define LL long long
#define FOR(x, maxx) for(i = 0; i < maxx; i++)
using namespace std;

const int MAXN = 2e5+10;

LL stak[MAXN];
int top;

int main()
{
    int N, i;
    bool flag = true;
    LL x;
    top = 0;
    scanf("%d", &N);
    scanf("%I64d", &x);
    stak[++top] = x;
    LL maa = x;
    FOR(i, N-1){
        scanf("%I64d", &x);
        if(x > stak[top] && top > 0) flag = false;
        else if(x == stak[top] && flag) top--;
        else   stak[++top] = x;
        maa = max(maa, x);
    }

    if(top > 1 || !flag) puts("NO");
    else{
            if(top == 1 && stak[top] != maa) puts("NO");
            else puts("YES");
    }

    return 0;
}