B. Amr and The Large Array
time limit per test
memory limit per test
input
output
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
n (1 ≤ n ≤ 105), the size of the array.
n integers ai (1 ≤ ai ≤ 106), representing elements of the array.
Output
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.
Sample test(s)
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
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
给出一个序列，然后找出出现次数最多，但区间占用长度最短的区间左右值。
点击打开链接
#include
#include
#include
#include
#include
#define N 1000001
using namespace std;
int n,m;
struct node
{
int x;
int y;
int ans;
int cnt;
}q[1000100];
bool cmp(node a,node b)
{
if(a.cnt == b.cnt)
{
return a.ans b.cnt;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
int mm;
for(int i=0;i 服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.e1idc.net
