D. Pair of Numbers
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Simon has an array a1, a2, ..., an, consisting of n positive integers. Today Simon asked you to find a pair of integers l, r (1 ≤ l ≤ r ≤ n), such that the following conditions hold:

  1. there is integer j (l ≤ j ≤ r), such that all integers al, al + 1, ..., ar are divisible by aj;
  2. value r - l takes the maximum value among all pairs for which condition 1 is true;

Help Simon, find the required pair of numbers (l, r). If there are multiple required pairs find all of them.

Input

The first line contains integer n (1 ≤ n ≤ 3·105).

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 106).

Output

Print two integers in the first line — the number of required pairs and the maximum value of r - l. On the following line print all l values from optimal pairs in increasing order.

Examples
Input
5
4 6 9 3 6
Output
1 3
2
Input
5
1 3 5 7 9
Output
1 4
1
Input
5
2 3 5 7 11
Output
5 0
1 2 3 4 5
Note

In the first sample the pair of numbers is right, as numbers 6, 9, 3 are divisible by 3.

In the second sample all numbers are divisible by number 1.

In the third sample all numbers are prime, so conditions 1 and 2 are true only for pairs of numbers (1, 1), (2, 2), (3, 3), (4, 4), (5, 5).

【分析】给定一个正整数数组,求最长的区间,使得该区间内存在一个元素,它能整除该区间的每个元素。

可能我的方法有点复杂吧。我是先从小到大排序,记录所有数的位置,然后从小到大向两边扩展,就行了,详细见代码一。还有种做法类似DP,很短很神奇,见代码二。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof a)
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
const int N = 3e5+;
const int M = 1e6+;
int n,m,k,tot=,tim=;
int head[N],vis[N],l[N],r[N];
int a[N],b[N];
vector<pair<int,int> >vec;
vector<int>Ans;
struct man{
int l,r,len;
}ans[N];
bool cmp(man s,man d){
return s.len>d.len;
}
void Find(int p) {
vis[p]=;
int ret=;
int u=b[p];
int ll,rr;
++tot;
for(int i=; i<=n; i++) {
if(!l[tot]) {
ll=p-i;
if(ll>=&&b[ll]%u==) {
vis[ll]=;
} else l[tot]=ll+,ret++;
}
if(!r[tot]) {
rr=p+i;
if(rr<=n&&b[rr]%u==) {
vis[rr]=;
} else r[tot]=rr-,ret++;
}
if(ret==)return;
}
}
int main() {
scanf("%d",&n);
for(int i=; i<=n; i++) {
scanf("%d",&a[i]);
b[i]=a[i];
vec.pb(mp(a[i],i));
}
sort(vec.begin(),vec.end());
for(int i=;i<n;i++){
int p=vec[i].second;
if(!vis[p])Find(p);
}
for(int i=; i<=tot; i++) {
ans[i-].l=l[i];
ans[i-].r=r[i];
ans[i-].len=r[i]-l[i];
}
sort(ans,ans+tot,cmp);
int t=ans[].len,ret=;
for(int i=;i<tot;i++){
if(ans[i].len<t)break;
ret++;
}
printf("%d %d\n",ret,t);
for(int i=;i<ret;i++){
Ans.pb(ans[i].l);
}
sort(Ans.begin(),Ans.end());
for(int i=;i<ret;i++){
printf("%d ",Ans[i]);
}
printf("\n");
return ;
}
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof a)
#define pb push_back
typedef long long ll;
using namespace std;
const int N = 2e6+;
const int M = 1e6+;
int n,L,R,len,Ans,xllend3;
int a[N],ans_l[N],ans_r[N],ans[N];
void init() {
scanf("%d",&n);
for(int i=; i<=n; ++i)scanf("%d",&a[i]),ans_l[i]=ans_r[i]=i;
}
void work() {
for(int i=; i<=n; ++i)for(; ans_l[i]>&&a[ans_l[i]-]%a[i]==;)ans_l[i]=ans_l[ans_l[i]-];
for(int i=n; i>=; --i)for(; ans_r[i]<n&&a[ans_r[i]+]%a[i]==;)ans_r[i]=ans_r[ans_r[i]+];
for(int i=; i<=n; ++i) {
L=ans_l[i];
R=ans_r[i];
if(R-L==len)ans[++Ans]=L;
if(R-L>len)len=R-L,ans[Ans=]=L;
}
} void outit() {
sort(ans+,ans+Ans+);
for(int i=; i<=Ans; ++i)if(ans[i]!=ans[i-])++xllend3;
printf("%d %d\n%d",xllend3,len,ans[]);
for(int i=; i<=Ans; ++i)if(ans[i]!=ans[i-])printf(" %d",ans[i]);
puts("");
} int main() {
init();
work();
outit();
return ;
}

Codeforces Round #209 (Div. 2) D. Pair of Numbers (模拟)的更多相关文章

  1. Codeforces Round #367 (Div. 2) B. Interesting drink (模拟)

    Interesting drink 题目链接: http://codeforces.com/contest/706/problem/B Description Vasiliy likes to res ...

  2. Codeforces Round #209 (Div. 2)A贪心 B思路 C思路+快速幂

    A. Table time limit per test 1 second memory limit per test 256 megabytes input standard input outpu ...

  3. Codeforces Round #209 (Div. 2) B. Permutation

    解题思路: 如果序列a是单调递增的,则序列为1,2,..... 2n,则将给出的式子化简得Σ(a2i - a2i-1) = n 如果序列a是单调递减的,则序列为2n,.........2, 1,则将给 ...

  4. Codeforces Round #209 (Div. 2) A. Table

    #include <iostream> #include <vector> using namespace std; int main(){ int n,m; cin > ...

  5. Codeforces Round #209 (Div. 2)C

    刷了一页的WA  ..终于发现了 哪里错了 快速幂模板里一个变量t居然开得long  ... 虽然代码写的丑了点 但是是对的 那个该死的long 啊.. #include <iostream&g ...

  6. Codeforces Round #209 (Div. 2)

    A: 要么是两次要么4次,判断是否在边界: #include<cstdio> using namespace std; int main() { int n,m,x; ; scanf(&q ...

  7. Codeforces Round #209 (Div. 2) C - Prime Number

    传送门 题意 给出n个数及x,求 \[\frac{\sum _{i=1}^n x^{a_1+a_2+...+a_{i-1}+a_{i+1}+...a_n}}{\prod_{i=1}^n x^{a_i} ...

  8. Codeforces Round #627 (Div. 3) D - Pair of Topics(双指针)

    题意: 有长为n的a,b两序列,问满足ai+aj>bi+bj(i<j)的i,j对数. 思路: 移项得:(ai-bi)+(aj-bj)>0,i<j即i!=j,用c序列保存所有ai ...

  9. Codeforces Round #379 (Div. 2) D. Anton and Chess 模拟

    题目链接: http://codeforces.com/contest/734/problem/D D. Anton and Chess time limit per test4 secondsmem ...

随机推荐

  1. CF762E Radio Stations

    题目戳这里. 我还以为是KDtree呢,但是KDtree应该也可以做吧. 这是一道数据结构好题.考虑到由于\(K \le 10\),所以我们用两个大vector--\(Left,Right\),\(L ...

  2. poj 1201 TYVJ 1415 Intervals

    Description: 给定n个闭区间[ai,bi] 和n个整数ci,你需要构造一个集合Z,使得对于任何的i∈[1,n],Z中满足x∈[ai,bi]的x不少于ci个 求这样的整数集合Z至少包含多少个 ...

  3. Light OJ 1074:Extended Traffic(spfa判负环)

    Extended Traffic 题目链接:https://vjudge.net/problem/LightOJ-1074 Description: Dhaka city is getting cro ...

  4. fieldset——一个不常用的HTML标签

    fieldset 标签 -- 对表单进行分组 在form表单中,我们可以对form中的信息进行分组归类,如注册表单的form,我们可以将注册信息分组成 基本信息(一般为必填) 详细信息(一般为可选) ...

  5. vue2.0基础知识,及webpack中vue的使用

    ## 基础指令 ## [v-cloak]{         Display:none;     }     <p v-cloak>xx{{msg}}xx</p> //解决闪烁问 ...

  6. Round 0: Regionals 2010 :: NEERC Eastern Subregional

    Round 0: Regionals 2010 :: NEERC Eastern Subregional 贴吧题解(官方)? 网上的题解 水 A Murphy's Law 题意:Anka拿着一块涂着黄 ...

  7. HDU1267 下沙的沙子有几粒? 基础DP

    题目链接 题意:给定m个H和n个D(1<=n,m<=20),问这些字母构成的序列中,对于任意位置,从左开始数H的累积个数总是不比D的累计数少的排列有多少种. 题解:二维DP,画一个正方形, ...

  8. MySQL 查询语句练习1

    1.创建成绩表,字段包括:学生姓名,语文成绩,数学成绩,英语成绩 向表中插入多条数据: 查询: (1) 查询所有学生的数学成绩和总成绩 (2) 查询所有学生的语文和数学成绩和,按从高到低排序 (3) ...

  9. algorithm ch6 heapsort

    堆排序利用的是堆这种数据结构来对进行排序,(二叉)堆可以被视为一棵完全的二叉树,树的每个节点与数组中存放该节点的值得那个元素对应.这里使用最大堆进行排序算法设计,最大堆就是parent(i) > ...

  10. Linux ALSA介绍

    1. 介绍 ALSA(即Advanced Linux Sound Architecture), 是目前Linux的主流音频体系结构, 提供了音频和MIDI的支持, 其架构图如下所示 TIP: 笔者的代 ...