CodeForces 352B 水题

最新推荐文章于 2017-12-08 15:36:42 发布

原创最新推荐文章于 2017-12-08 15:36:42 发布 · 311 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于找出整数序列中位置形成等差数列的元素及其等差差值。通过使用多种数据结构如 map 和 vector，该算法能够有效地处理大量数据，并按递增顺序输出所有符合条件的元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

One day Jeff got hold of an integer sequence a₁, a₂, ..., a_n of length n. The boy immediately decided to analyze the sequence. For that, he needs to find all values of x, for which these conditions hold:

x occurs in sequence a.
Consider all positions of numbers x in the sequence a (such i, that a_i = x). These numbers, sorted in the increasing order, must form an arithmetic progression.

Help Jeff, find all x that meet the problem conditions.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵). The next line contains integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵). The numbers are separated by spaces.

Output

In the first line print integer t — the number of valid x. On each of the next t lines print two integers x and p_x, where x is current suitable value, p_x is the common difference between numbers in the progression (if x occurs exactly once in the sequence, p_x must equal 0). Print the pairs in the order of increasing x.

Examples

Input

1
2

Output

1
2 0

Input

8
1 2 1 3 1 2 1 5

Output

Note

In the first test 2 occurs exactly once in the sequence, ergo p₂ = 0.

题意，查找一串序列中，出现位置为等差数列的数

代码：

//By Sean Chen
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

struct node{
    int num,p;
};
map <int,int> P;
map <int,int> prepos;
map <int,int> flag;
vector <int> num;
node ans[100005];
int b;
int cmp(node a,node b)
{
    return a.num<b.num;
}
int main()
{
    int n;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&b);
        if (!prepos[b])
        {
            num.push_back(b);
            flag[b]=1;
        }
        else if (P[b]!=0 && i-prepos[b]!=P[b])
        {
            flag[b]=0;
        }
        else if (P[b]==0)
        {
            P[b]=i-prepos[b];
        }
        prepos[b]=i;
    }
    node temp;
    int cnt=0;
    for (int i=0;i<=num.size();i++)
    {
        if (flag[num[i]]==1)
        {
            temp.num=num[i];
            temp.p=P[num[i]];
            ans[cnt++]=temp;
        }
    }
    sort(ans,ans+cnt,cmp);
    printf("%d\n",cnt);
    for (int i=0;i<cnt;i++)
    {
        printf("%d %d\n",ans[i].num,ans[i].p);
    }
    return 0;
}