fzu 2216

最新推荐文章于 2020-11-06 15:33:52 发布

yjt9299

最新推荐文章于 2020-11-06 15:33:52 发布

阅读量157

点赞数

分类专栏：二分文章标签：二分

本文链接：https://blog.csdn.net/yjt9299/article/details/79952470

版权

二分专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Problem 2216 The Longest Straight

Accept: 497 Submit: 1546
Time Limit: 1000 mSec Memory Limit : 32768 KB

Problem Description

ZB is playing a card game where the goal is to make straights. Each card in the deck has a number between 1 and M(including 1 and M). A straight is a sequence of cards with consecutive values. Values do not wrap around, so 1 does not come after M. In addition to regular cards, the deck also contains jokers. Each joker can be used as any valid number (between 1 and M, including 1 and M).

You will be given N integers card[1] .. card[n] referring to the cards in your hand. Jokers are represented by zeros, and other cards are represented by their values. ZB wants to know the number of cards in the longest straight that can be formed using one or more cards from his hand.

Input

The first line contains an integer T, meaning the number of the cases.

For each test case:

The first line there are two integers N and M in the first line (1 <= N, M <= 100000), and the second line contains N integers card[i] (0 <= card[i] <= M).

Output

For each test case, output a single integer in a line -- the longest straight ZB can get.

Sample Input

2

   7 11 
 

   0 6 5 3 0 10 11 
 

   8 1000 
 

   100 100 100 101 100 99 97 103 
 

Sample Output

5

3

Source

第六届福建省大学生程序设计竞赛-重现赛（感谢承办方华侨大学）

题意：给你n 张牌上边写着几个数，如果这张上边写的数为 0 的话，就表示这张牌可以转化成其他任意小于等于m 的牌，因此需要你来求出最长的连续子序列子序列！

思路：我们先定义一个card 数组表示 1 （这张牌出现过） 0 （这张牌没有出现）

现在我们就不应该再研究原本的序列而是考虑一下你所拥有的卡片的数字组成的序列。就比如样例1 我们就因该研究

3 5 6 10 11 和0 之间的关系。那么我们可以转化一下设一个sum 数组（当然是递增的，所以我们就可以用二分）表示从第数字1到数字i 其中缺少的个数字的个数，也就是我们需要的0 的个数（因为0 可以去变成每一个数字）然后我们就可以枚举左端点然后二分去找到右端点，，二分的要找的位置就是我们当前点为左端点，根据我们手中现在有的 0 的个数就可以找到我们可以用0 去填补的最长连续子序列可以到哪个位置。然后相减就是最大长度。

代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define N 100005

using namespace std;

int card[N];
int zero;
int n,m;

int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		cin>>n>>m;
		zero=0;
		int x;
		memset(card,0,sizeof(card));
		
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&x);
			if(x==0) zero++;
			card[x]++;
		}
		
		for(int i=1;i<=m;i++){
			if(card[i]){
				card[i]=card[i-1];
			}
			else{
				card[i]=card[i-1]+1;
			}
		}
		
		int ans=1;
		for(int i=1;i<=m;i++)
		{
			int ind=upper_bound(card+1,card+m+1,zero+card[i-1])-(card+1);
			ind++;
			ans=max(ans,ind-i);
		}
		
		printf("%d\n",ans);
		
		//cout<<ans<<endl;
	}
	
	return 0;
}