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.
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.
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.
7
3 3 4 7 5 6 8
4
2 3 5 6
6
1 3 5 2 4 6
2
1 4
4
10 9 8 7
1
1
9
6 7 8 3 4 5 9 10 11
6
1 2 3 7 8 9
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]
//最开始开了b、c两个数组,一个存长度,一个存位置
//存长度的可以到10的9次方,要爆要爆
//只能用map优化,动态存储,有多少开多少
//因为找连续的数字,并输出位置,所以只要知道最后一个就可以了
#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int a[maxn];
map<int,int>c;
stack<int>s;
int main()
{
int n;
int ans=-1;
int maxx=-1;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
c[a[i]]=c[a[i]-1]+1;
if(c[a[i]]>ans)
{
ans=c[a[i]];
maxx=a[i];
}
}
printf("%d\n",ans);
for(int i=n;i>=1;i--)
{
if(a[i]==maxx)
{
maxx--;
s.push(i);
}
}
while(!s.empty())
{
printf("%d ",s.top());
s.pop();
}
printf("\n");
return 0;
}