Consecutive Subsequence（最长上升子序列）

You are given an integer array of length nn.

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][x,x+1,…,x+k−1] for some value xx and length kk.

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][5,3,1,2,4] the following arrays are subsequences: [3][3], [5,3,1,2,4][5,3,1,2,4], [5,1,4][5,1,4], but the array [1,3][1,3] is not.

Input
The first line of the input containing integer number nn (1≤n≤2⋅1051≤n≤2⋅105) — the length of the array. The second line of the input containing nn integer numbers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the array itself.

Output
On the first line print kk — 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.

Examples
Input
7
3 3 4 7 5 6 8
Output
4
2 3 5 6
Input
6
1 3 5 2 4 6
Output
2
1 4
Input
4
10 9 8 7
Output
1
1
Input
9
6 7 8 3 4 5 9 10 11
Output
6
1 2 3 7 8 9
Note
All valid answers for the first example (as sequences of indices):

[1,3,5,6][1,3,5,6]
[2,3,5,6][2,3,5,6]
All valid answers for the second example:

[1,4][1,4]
[2,5][2,5]
[3,6][3,6]
All valid answers for the third example:

[1][1]
[2][2]
[3][3]
[4][4]
All valid answers for the fourth example:

[1,2,3,7,8,9]
题意：找出最长的上升子序列，并且子序列中的元素都是差一。输出长度和在原数组中的位置。
思路：我们用map标记x前一位x-1出现的位置，然后map[x]=map[x-1]+1。map最大值就是子序列的最大长度。然后我们知道这个序列的最大值y,y-max+1就是序列的起始值。后面就能找出各个位置来了。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxx=2e5+100;
int a[maxx];
int b[maxx];
int n;

int main()
{
	scanf("%d",&n);
	map<int,int> mp;
	mp.clear();
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		mp[a[i]]=mp[a[i]-1]+1;
	}
	int _max=0,pos;
	for(int i=1;i<=n;i++) 
	{
		if(_max<mp[a[i]])
		{
			_max=mp[a[i]];
			pos=i;
		}
	}
	printf("%d\n",_max);
	int x=a[pos]-_max+1;
	for(int i=1;i<=n;i++)
	{
		if(a[i]==x) 
		{
			printf("%d ",i);
			x++;
		}
	}
	puts("");
}

努力加油a啊，(^o)/~