Code/LIS.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

int search(int A[], int l, int r, int key)
{
	int m;
	while(r-l>1)
	{
		m = l+ (r-l)/2;
		if(A[m]>=key)
			r=m;
		else
			l=m;
	}
	return r;
}

int solve(int A[], int size)
{
	int temp[size];
	int len;
	memset(temp, 0, sizeof(temp));

	temp[0]=A[0];
	len=1;

	for(int i=1;i<size;i++)
	{
		if(A[i]<temp[0])
		{
			temp[0]=A[0];
		} else if(A[i]>temp[len-1])
		{
			temp[len++]=A[i];
		} else
		{
			temp[search(temp, -1, len-1, A[i])]=A[i];
		}
	}
	delete[] temp;
	return len;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

	int A[] = { 2, 5, 3, 7, 11, 8, 10, 13, 6 };
	int len=sizeof(A)/sizeof(A[0]);

	cout<<solve(A, len)<<endl;
    system("pause");
}