codeforces 997F Consecutive Subsequence (dp)

题意就是让你找一个最长的公差为1的等差数列，然后输出他们的下标。

思路：用一个map表示到当前这个数的最大长度为多少，则有如下递推公式

$$mp[a[i]] = mp[a[i]-1] + 1$$

然后用一个pre记录一下前序就行了。
代码如下:

#include<iostream>
#include<cstring>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<vector>
using namespace std;
const int MAX = 200010;
int a[MAX],N,pre[MAX];
map<int, int> mp;
map<int, int> pos;//记录每个数在哪个位置
int main(void) {
    memset(pre, -1, sizeof(pre));
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i) {
        scanf("%d", &a[i]);
        pos[a[i]] = i;
        if (mp.count(a[i] - 1)) {//如果a[i]-1存在
            mp[a[i]] = mp[a[i] - 1] + 1;
            pre[i] = pos[a[i] - 1];
        }
        else {//不存在相当于0
            mp[a[i]] = 1;
        }
    }
    int res = 0;
    int p = 0;
    for (map<int, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
        if (it->second > res) {//寻找最大长度
            res = it->second;
            p = pos[it->first];
        }
    }
    vector<int> vec;
    while (p != -1) {
        vec.push_back(p);
        p = pre[p];
    }
    reverse(vec.begin(), vec.end());
    printf("%d\n", (int)vec.size());
    for (int i = 0; i < vec.size(); ++i) {
        printf("%d", vec[i]);
        if (i != vec.size() - 1)
            printf(" ");
        else
            printf("\n");
    }
    return 0;
}