CodeForces 352B

B - Jeff and Periods

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 352B

Description

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.

Sample Input

Input

1
2

Output

1
2 0

Input

8
1 2 1 3 1 2 1 5

Output

4
1 2
2 4
3 0
5 0

Hint

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

题目大意：

给出 n 个数字，然后让从小到大 输出  第一次出现这个数字和下一次出现这数字  的距离  ，这个距离必须是公共距离。

思路：

直接模拟  set 写就可以了  cf 的评测机 毕竟很强大。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int vis[100005],last[100005],ans[100005];
set<int> ss;
set<int> ::iterator it;
int main()
{
    int n;
    cin>>n;
    int aa;
    for(int i=0;i<n;i++)
    {
        cin>>aa;
        if(vis[aa]==0)
        {
            ss.insert(aa);
            vis[aa]=1;
        }
        else
        {
            if(ans[aa]&&ans[aa]!=i-last[aa])
            {
                ss.erase(aa);
            }
            ans[aa]=i-last[aa];
        }
        last[aa]=i;
    }
    cout<<ss.size()<<endl;
    for(it=ss.begin();it!=ss.end();it++)
    {
        cout<<*it<<" "<<ans[*it]<<endl;
    }
}