LuoguAT2827 LIS （LIS）

裸题
#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#define R(a,b,c) for(register int  a = (b); a <= (c); ++ a)

#define nR(a,b,c) for(register int  a = (b); a >= (c); -- a)

#define Max(a,b) ((a) > (b) ? (a) : (b))

#define Min(a,b) ((a) < (b) ? (a) : (b))

#define Fill(a,b) memset(a, b, sizeof(a))

#define Abs(a) ((a) < 0 ? -(a) : (a))

#define Swap(a,b) a^=b^=a^=b

#define ll long long

#define ON_DEBUG

#ifdef ON_DEBUG

#define D_e_Line printf("\n\n----------\n\n")

#define D_e(x)  cout << #x << " = " << x << endl

#define Pause() system("pause")

#define FileOpen() freopen("in.txt","r",stdin);

#else

#define D_e_Line ;

#define D_e(x)  ;

#define Pause() ;

#define FileOpen() ;

#endif

struct ios{

    template<typename ATP>ios& operator >> (ATP &x){

        x = 0; int f = 1; char c;

        for(c = getchar(); c < '0' || c > '9'; c = getchar()) if(c == '-')  f = -1;

        while(c >= '0' && c <= '9') x = x * 10 + (c ^ '0'), c = getchar();

        x*= f;

        return *this;

    }

}io;

using namespace std;

const int N = 100007;

int a[N], b[N];

int main(){

	int n;

	io >> n;

	R(i,1,n){

		io >> a[i];

	}

	int len = 0;

	b[++len] = a[1];

	R(i,2,n){

		if(a[i] > b[len]){

			b[++len] = a[i];

		}

		else{

			int pos = upper_bound(b + 1, b + len + 1, a[i]) - b;

			b[pos] = a[i];

		}

	}

	printf("%d", len);

	return 0;

}
巴特西

LuoguAT2827 LIS （LIS）

最新文章

热门文章
