contest: Codeforces Round #479 (Div. 3), problem: (F) Consecutive Subsequence

最新推荐文章于 2019-09-11 16:30:41 发布

原创最新推荐文章于 2019-09-11 16:30:41 发布 · 345 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

codeforces fighting 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种解决最长连续子序列问题的有效算法。通过使用 C++ 的 map 数据结构，该算法能够在给定整数数组中找到最长的连续递增子序列，并输出其最大长度及对应的元素索引。

You are given an integer array of length $n$ .

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, \dots, x + k - 1]$ for some value $x$ and length $k$ .

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

Input

The first line of the input containing integer number $n$ ( $1 \leq n \leq 2 \cdot 10^{5}$ ) — the length of the array. The second line of the input containing $n$ integer numbers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 10^{9}$ ) — the array itself.

Output

On the first line print $k$ — 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
inputCopy
7
3 3 4 7 5 6 8
outputCopy
4
2 3 5 6 
inputCopy
6
1 3 5 2 4 6
outputCopy
2
1 4 
inputCopy
4
10 9 8 7
outputCopy
1
1 
inputCopy
9
6 7 8 3 4 5 9 10 11
outputCopy
6
1 2 3 7 8 9 

Note

All valid answers for the first example (as sequences of indices):

$[1, 3, 5, 6]$
$[2, 3, 5, 6]$

All valid answers for the second example:

$[1, 4]$
$[2, 5]$
$[3, 6]$

All valid answers for the third example:

$[1]$
$[2]$
$[3]$
$[4]$

All valid answers for the fourth example:

$[1, 2, 3, 7, 8, 9]$

#include <cstdio>
#include <map>
#include<iostream>
using namespace std;
const int maxn = 2e5+5;
int num[maxn];
int n,k=0,mi,mx;
map <int ,int > mp;
int main()
{
	cin>>n;
	for(int i=0;i<n;i++){
		scanf("%d",num+i);
		mp[num[i]] = mp[num[i] - 1] + 1;
		if(mp[num[i]] > mx){
			mi = num[i];
			mx = mp[num[i]];
		}
	}
	cout<<mx<<endl;
	k = mi - mx + 1;
	for(int i = 0; mx ; i++){
		if(num[i] == k){
			cout<<i+1<<" ";
			k++;
			mx--;
		}
	}
	return 0;	
}

在大输入的情况下就算加入了std::ios::sync_with_stdio(false)仍然比scanf慢0.1秒。

下次还是使用scanf吧。这道题使用了map，是我没有想到的。本来我也是这个想法，对于每一个开头开一个标志，但是由于数字太大，数组是开不出来的，没想到还有map这种黑科技。学到了，学到了。