博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Codeforces 558B Amr and The Large Array
阅读量:5832 次
发布时间:2019-06-18

本文共 2278 字,大约阅读时间需要 7 分钟。

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.

Sample test(s)
input
51 1 2 2 1
output
1 5
input
51 2 2 3 1
output
2 3
input
61 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

#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;const double PI = acos(-1.0);const double e = 2.718281828459;const double eps = 1e-8;struct node{ int num; int time; int l; int r; int range;} index[1000010];int main(){ //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); int n; while(cin>>n) { map
g; g.clear(); memset(index, 0, sizeof(index)); int t; int d = 0; int dd; int maxd = 1; int maxtime = 0; int maxrange = 1; for(int i = 1; i <= n; i++) { scanf("%d", &t); if(g[t] != 0) { dd = g[t]; index[dd].time++; index[dd].r = i; index[dd].range = index[dd].r-index[dd].l+1; if(maxtime
index[dd].range) { maxtime = index[dd].time; maxd = dd; maxrange = index[dd].range; } } else { g[t] = ++d; dd = g[t]; index[dd].num = t; index[dd].time = 1; index[dd].l = index[dd].r = i; index[dd].range = 1; if(maxtime < index[dd].time) { maxtime = index[dd].time; maxd = dd; maxrange = 1; } } } printf("%d %d\n", index[maxd].l, index[maxd].r); } return 0;}

转载地址:http://chedx.baihongyu.com/

你可能感兴趣的文章
Win配置Apache+mod_wsgi+django环境+域名
查看>>
linux清除文件内容
查看>>
WindowManager.LayoutParams 详解
查看>>
find的命令的使用和文件名的后缀
查看>>
Android的Aidl安装方法
查看>>
Linux中rc的含义
查看>>
曾鸣:区块链的春天还没有到来| 阿里内部干货
查看>>
如何通过Dataworks禁止MaxCompute 子账号跨Project访问
查看>>
js之无缝滚动
查看>>
Django 多表联合查询
查看>>
logging模块学习:basicConfig配置文件
查看>>
Golang 使用 Beego 与 Mgo 开发的示例程序
查看>>
+++++++子域授权与编译安装(一)
查看>>
asp.net怎样在URL中使用中文、空格、特殊字符
查看>>
路由器发布服务器
查看>>
实现跨交换机VLAN间的通信
查看>>
python例子
查看>>
环境变量(总结)
查看>>
ios之UILabel
查看>>
Java基础之String,StringBuilder,StringBuffer
查看>>