codeforces 977F dp回溯路径

题意：找出子序列中，连续严格上升的序列的最大长并打印位置。
这里dp[i]表示第i个结尾的最大上升长度。
dp[i]=max(dp[i-1]+1)。
这里a[i]很大，我们采用map。题目要求打印路径我们就记录一个前驱（我这里写的略显臃肿，脑子抽了）。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<cstdio>
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
ll read()
{
	char ch = getchar(); ll x = 0, f = 1;
	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
typedef pair<int, int> pir;
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lrt root<<1
#define rrt root<<1|1
int n;
const int N = 2e5 + 10;
ll a[N];
struct node { ll a, b; bool operator <(const node &k)const {
	if (a == k.a) { if (b > k.b)return true; else return false; }
	else if (a > k.a)return true;
	else return false;
} };
map<ll, set<node> > mp;
int pre[N];
int main()
{
	n = read();
	upd(i, 1, n)a[i] = read();
	memset(pre, -1, sizeof(pre));
	upd(i, 1, n)
	{
		ll temp; int pos;
		if (mp[a[i] - 1].empty())temp = 1, pos = -1;
		else { temp = (*mp[a[i] - 1].begin()).a + 1, pos = (*mp[a[i] - 1].begin()).b; }
		if (mp[a[i]].empty()) { mp[a[i]].insert(node{ temp, i }); pre[i] = pos; }
		else if ((*mp[a[i]].begin()).a <= temp)
		{
			mp[a[i]].insert(node{ temp, i });
			pre[i] = pos;
		}
	}
	ll ans = 0;
	int pos = 0;
	for (auto k : mp)
	{
		if (k.second.empty())continue;
		if (ans < (*k.second.begin()).a) {
			ans = (*k.second.begin()).a;	
			pos = (*k.second.begin()).b;
		}
	}
	cout << ans << endl;
	vector<int >vec;
	for (; pos!= -1; pos = pre[pos])
		vec.push_back(pos);
	reverse(vec.begin(), vec.end());
	for (auto k : vec)cout << k <<  " ";
}