CF558B.Amr and The Large Array

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Amr has got a large array of size $n$ . Amr doesn't like large arrays so he intends to make it smaller.

Amr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.

Help Amr by choosing the smallest subsegment possible.

输入格式

The first line contains one number $n$ ( $1<=n<=10^{5}$ ), the size of the array.

The second line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=10^{6}$ ), representing elements of the array.

输出格式

Output two integers $l,r$ ( $1<=l<=r<=n$ ), the beginning and the end of the subsegment chosen respectively.

If there are several possible answers you may output any of them.

输入输出样例

输入#1
```
5
1 1 2 2 1
```
输出#1
```
1 5
```
输入#2
```
5
1 2 2 3 1
```
输出#2
```
2 3
```
输入#3
```
6
1 2 2 1 1 2
```
输出#3
```
1 5
```

说明/提示

A subsegment $B$ of an array $A$ from $l$ to $r$ is an array of size $r-l+1$ where $B_{i}=A_{l+i-1}$ for all $1<=i<=r-l+1$

首页