codeforce 977f 动态规划和map

Consecutive Subsequence
You are given an integer array of length n

.

You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers. In other words the required sequence should be equal to [x,x+1,…,x+k−1]
for some value x and length k

.

Subsequence of an array can be obtained by erasing some (possibly zero) elements from the array. You can erase any elements, not necessarily going successively. The remaining elements preserve their order. For example, for the array [5,3,1,2,4]
the following arrays are subsequences: [3], [5,3,1,2,4], [5,1,4], but the array [1,3]is not.
Input
The first line of the input containing integer number n(1≤n≤2⋅105) — the length of the array. The second line of the input containing n integer numbers a1,a2,…,an (1≤ai≤109) — the array itself.
Output
On the first line print k— the maximum length of the subsequence of the given array that forms an increasing sequence of consecutive integers.

On the second line print the sequence of the indices of the any maximum length subsequence of the given array that forms an increasing sequence of consecutive integers.
题意：在给出的序列中找出最长的连续升序，要求输出的每一个数的位置依次增加。首先我的思路是遍历每一个数，然后在从每一个数依次向后遍历，这样找出最大的序列并保存下来。循环中套循环，我们就要想到它的复杂度是O（n2），给的n小于200000，显然这回超时，于是我们再想别的办法。
肯定不能让它循环套循环，那么我们就想一次循环能不能保存下来，就有了i从1到n，mp【i】=mp【i-1】+1；的思路。这里的mp不能用数组来表示，需要用map。因为数组至多开到几十万，虽然map也只能几十万个，但是map又不是限定了1到几十万，map反应的是对应关系！！！！！！。这方面是吊打数组的。代码如下

#include <iostream>
#include <map>
#include <cstdio>
using namespace std;
int main()
{
    map <int,int> mp;
    int s[200005];
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i];
    }
    for(int i=1;i<=n;i++){
        mp[s[i]]=mp[s[i]-1]+1;
    }
    int maxn=0;
    int jj;
    for(int i=1;i<=n;i++){
        maxn=max(mp[s[i]],maxn);
        if(maxn==mp[s[i]])
            jj=i;
    }
    int f=s[jj]-maxn+1;
    cout<<maxn<<endl;
    for(int i=1;i<=n;i++){
        if(s[i]==f){
            f++;
            cout<<i<<" ";
        }
    }
    return 0;
}