ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

5169: Amr and The Large Array

内存限制：256 MB 时间限制：2 S
题面：传统 评测方式：文本比较 上传者：
提交：0 通过：0
提交提交记录统计Web Board

题目描述

B. Amr and The Large Array
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
The first line contains one number n (1≤n≤105), the size of the array.
The second line contains n integers ai (1≤ai≤106), representing elements of the array.
Output
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.
Examples
Input 
5
1 1 2 2 1
Output 
1 5
Input 
5
1 2 2 3 1
Output 
2 3
Input 
6
1 2 2 1 1 2
Output 
1 5
Note
A subsegment B of an array A from l to r is an array of size r-l+1 where Bi=Al+i-1 for all 1≤i≤r-l+1

输入样例 复制

输出样例 复制

分类标签