codeforces 620C Pearls in a Row

There are n pearls in a row. Let’s enumerate them with integers from 1 to n from the left to the right. The pearl number i has the type ai.

Let’s call a sequence of consecutive pearls a segment. Let’s call a segment good if it contains two pearls of the same type.

Split the row of the pearls to the maximal number of good segments. Note that each pearl should appear in exactly one segment of the partition.

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of pearls in a row.

The second line contains n integers ai (1 ≤ ai ≤ 109) – the type of the i-th pearl.

Output
On the first line print integer k — the maximal number of segments in a partition of the row.

Each of the next k lines should contain two integers lj, rj (1 ≤ lj ≤ rj ≤ n) — the number of the leftmost and the rightmost pearls in the j-th segment.

Note you should print the correct partition of the row of the pearls, so each pearl should be in exactly one segment and all segments should contain two pearls of the same type.

If there are several optimal solutions print any of them. You can print the segments in any order.

If there are no correct partitions of the row print the number “-1”.

Example
Input
5
1 2 3 4 1
Output
1
1 5
Input
5
1 2 3 4 5
Output
-1
Input
7
1 2 1 3 1 2 1
Output
2
1 3
4 7

题意：给出一个n大小的序列，截取一段，如果这一段有2个相同的数字，那么就是好的子序列，问最多有几个好子序列

zz。。。一开始以为只能确定是某个数字，后来发现是任意一个 相同就可以。。那就简单了。。。

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int a[3*maxn];
int res[maxn][3];
map<int,int> mp;
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    scanf("%d",&a[i]);
    int sum=0;
    int id=-1;
        int ai=1;
        int len=0;
        int tot=0;
        int aj=1;
        for(int i=1;i<=n;i++)
        {
            mp[a[i]]++;
            if(mp[a[i]]==2){
                mp.clear();
                    tot++;
                    aj=i;
                    res[len][0]=ai,res[len][1]=i;
                    len++;
                    tot=0;
                    ai=i+1;
            }
        }
        if(len==0)
        {
            printf("-1\n");
            return 0;
        }
        res[len-1][1]=n;
        printf("%d\n",len);
        for(int i=0;i<len;i++)
        {
            printf("%d %d\n",res[i][0],res[i][1]);
        }
}