【贪心】+【map】

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
题目大意 有一个序列 a1 a2 a3 a4 a5 。 每一个数字代表了 每一个珍珠的种类，一个好的 区间 就是 其中只有一对 种类相同的珍珠 ，问怎么划分 才可以让其 有更多的 好区间
代码
代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#define LL long long
#define M  1000000
#define inf 0x3f3f3f3f
#define mod 100009
using namespace std;
struct data{ int l,r;};
data anwser[M];
map<int ,int >vis;
int arr[M];
int main()
{
    int n;
    scanf("%d",&n);
    int i,j;
    for(i=1;i<=n;i++)
    scanf("%d",&arr[i]);

    int k=0;int l=1;
    vis.clear();
    for(i=1;i<=n;i++)
    {
        if(!vis[arr[i]]) vis[arr[i]]++;
        else 
        {
            anwser[k].l=l;
            anwser[k++].r=i;
            l=i+1;
            vis.clear();
        }
    }
    if(!k) printf("-1\n");
    else 
    {
        anwser[k-1].r=n;   // 这里有坑 ，最后一组好的区间一定要将剩下的都包括在内 
        printf("%d\n",k);
        for(i=0;i<k;i++)
        printf("%d %d\n",anwser[i].l,anwser[i].r);
    }

    return 0;
}