FZU 2216 The Longest Straight （二分+01优化）

 Problem 2216 The Longest Straight

Accept: 446    Submit: 1394
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

27 110 6 5 3 0 10 118 1000100 100 100 101 100 99 97 103

 Sample Output

53

 Source

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

123

【思路】

把0 插入， 但如果 一遍一遍暴力扫的话 肯定超时， 或者 将 数进行处理，  数存在 对应位置 赋值为1   统计0 的个数， 

若不用二分，两个下标 一前一后，   用二分 就是 扫描区间 维护 区间值，

【代码实现】

  cin  cout  超时，   输入挂 WA  用 scanf 

//#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <cstring>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <stdlib.h>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <vector>
#define mem(a,b) memset(a,b,sizeof(a))
#define findx(x) lower_bound(b+1,b+1+bn,x)-b
#define FIN      freopen("input.txt","r",stdin)
#define FOUT     freopen("output.txt","w",stdout)
#define S1(n)    scanf("%d",&n)
#define SL1(n)   scanf("%I64d",&n)
#define S2(n,m)  scanf("%d%d",&n,&m)
#define SL2(n,m)  scanf("%I64d%I64d",&n,&m)
#define Pr(n)     printf("%d\n",n)
#define lson rt << 1, l, mid
#define rson rt << 1|1, mid + 1, r
#define  FI(n) IO::read(n)
#define  Be IO::begin()

using namespace std;
typedef long long ll;
const double PI=acos(-1);
const int INF=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=1e6+5;
const int MAXN=100105;
const int MOD=1e9+7;
const int mod=1e9+7;
int dir[5][2]={0,1,0,-1,1,0,-1,0};

namespace IO {
	const int MT = 1e6;
	char buf[MT]; int c,sz;
	void begin(){
		c = 0;
		sz = fread(buf, 1, MT, stdin);//一次性输入
	}
	template<class T>
	inline bool read(T &t){
		while( c < sz && buf[c] != '-' && ( buf[c]<'0' || buf[c] >'9')) c++;
		if( c>=sz) return false;
		bool flag = 0; if( buf[c]== '-') flag = 1,c++;
		for( t=0; c<=sz && '0' <=buf[c] && buf[c] <= '9'; c++ ) t= t*10 + buf[c]-'0';
		if(flag) t=-t;
		return true;
	}
}
/*ll inv[maxn*2];
inline void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){ x=1; y=0; d=a; }else{ ex_gcd(b,a%b,d,y,x); y-=x*(a/b);};}
inline ll gcd(ll a,ll b){ return b?gcd(b,a%b):a;}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll ans=exgcd(b,a%b,x,y);ll temp=x;x=y;y=temp-a/b*y;return ans;}
inline ll lcm(ll a,ll b){ return b/gcd(a,b)*a;}
inline ll qpow(ll x,ll n){ll res=1;for(;n;n>>=1){if(n&1)res=(res*x)%MOD;x=(x*x)%MOD;}return res;}
inline ll inv_exgcd(ll a,ll n){ll d,x,y;ex_gcd(a,n,d,x,y);return d==1?(x+n)%n:-1;}
inline ll inv1(ll b){return b==1?1:(MOD-MOD/b)*inv1(MOD%b)%MOD;}
inline ll inv2(ll b){return qpow(b,MOD-2);}*/

int a[MAXN];
int b[MAXN];
int main()
{
    //Be;
    int T;
    //FI(T);
    int n,m;
    cin>>T;
    while(T--)
    {
        mem(a,0);
        mem(b,0);
        //FI(n),FI(m);
        scanf("%d %d",&n,&m);
        int num=0;
        int x;
        for(int i=0;i<n;i++)
        {
           // FI(x);
           scanf("%d",&x);
            if(x)
                a[x]=1;
            else
                num++;
        }
        b[0]=0;
        for(int i=1;i<=m;i++)
        {
            if(a[i])
                b[i]=b[i-1];
            else
                b[i]=b[i-1]+1;
        }
        int ans=0;
        for(int i=0;i<=m;i++)
        {
            //cout<<b[i]<<" ";
            int l=i,r=m;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(b[mid]-b[i]>num)
                    r=mid-1;
                else
                    l=mid+1;
            }
            ans=max(ans,r-i);
        }
        cout<<ans<<endl;
    }
    return 0;
}