CF899E.Segments Removal

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Vasya has an array of integers of length nn .

Vasya performs the following operations on the array: on each step he finds the longest segment of consecutive equal integers (the leftmost, if there are several such segments) and removes it. For example, if Vasya's array is [13,13,7,7,7,2,2,2][13,13,7,7,7,2,2,2] , then after one operation it becomes [13,13,2,2,2][13,13,2,2,2] .

Compute the number of operations Vasya should make until the array becomes empty, i.e. Vasya removes all elements from it.

输入格式

The first line contains a single integer nn ( 1<=n<=2000001<=n<=200000 ) — the length of the array.

The second line contains a sequence a1,a2,...,ana_{1},a_{2},...,a_{n} ( 1<=ai<=1091<=a_{i}<=10^{9} ) — Vasya's array.

输出格式

Print the number of operations Vasya should make to remove all elements from the array.

输入输出样例

  • 输入#1

    4
    2 5 5 2
    

    输出#1

    2
    
  • 输入#2

    5
    6 3 4 1 5
    

    输出#2

    5
    
  • 输入#3

    8
    4 4 4 2 2 100 100 100
    

    输出#3

    3
    
  • 输入#4

    6
    10 10 50 10 50 50
    

    输出#4

    4
    

说明/提示

In the first example, at first Vasya removes two fives at the second and third positions. The array becomes [2,2][2,2] . In the second operation Vasya removes two twos at the first and second positions. After that the array becomes empty.

In the second example Vasya has to perform five operations to make the array empty. In each of them he removes the first element from the array.

In the third example Vasya needs three operations. In the first operation he removes all integers 44 , in the second — all integers 100100 , in the third — all integers 22 .

In the fourth example in the first operation Vasya removes the first two integers 1010 . After that the array becomes [50,10,50,50][50,10,50,50] . Then in the second operation Vasya removes the two rightmost integers 5050 , so that the array becomes [50,10][50,10] . In the third operation he removes the remaining 5050 , and the array becomes [10][10] after that. In the last, fourth operation he removes the only remaining 1010 . The array is empty after that.

首页