CF 977F - Consecutive Subsequence map

題目鏈接

題意：找最長遞增連續子序列， d， d+1.
輸出長度和路徑。

ac代碼：

#include <cstdio>
#include <string>
#include <iostream>
#include <map>
#include <cmath>
#include <cstring>
#include <queue>
#include <algorithm>
#include <iterator>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
const ll mx = 3e5+7;
map<int, int>dp;///注意不能用unordered_map建表會超時
int a[mx];
int main() {
    int n, b = 0, k;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
            dp[a[i]] = dp[a[i]-1]+1;
        if (dp[a[i]] > b) {
            b = dp[a[i]];
            k = i;
        }
    }
    printf("%d\n", b);
    for (int i = 0; i < n && b; ++i) {
        if (a[i] == a[k]-b+1) {
            b--;
            printf("%d ", i+1);
        }
    }
    puts("");
}