File size: 3,300 Bytes
8be366a | 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 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 | /*
+-+ +-+ +-+
|R| |.| |S|
+-+ +-+ +-+
*/
#include <bits/stdc++.h>
#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define db double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define sqr(x) (x)*(x)
#define D(x) cout<<#x " = "<<(x)<<endl
#define VI vector <int>
#define DBG pf("Hi\n")
#define MOD 100007
#define MAX 10000
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a) (int)a.size()
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define loop(i,n) for(int i=0;i<n;i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define ull unsigned long long
using namespace std;
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/
vector<int>v,print_ans;
int n=0;
int L[1000000];
int I[1000000];
int LIS_NlogK()
{
loop(i,n+2) I[i]=inf;
I[0]=-inf;
int length=0;
for(int i=1;i<=n;i++)
{
int low=0, hi=length, mid;
while(low<=hi)
{
mid=(low+hi)/2;
if(v[i]>I[mid])
low=mid+1;
else
hi=mid-1;
}
I[low]=v[i];
L[i]=low;
length=max(length,low);
}
return length;
}
int main()
{
// freopen("in.txt","r",stdin);
///freopen("out.txt","w",stdout);
v.pb(-100000);
int a;
while(sf(a)==1)
{
n++;
v.pb(a);
}
int ans=LIS_NlogK();
int i;
int temp=ans;
for(i=n;i>0;i--)
{
if(L[i]==temp)
{
temp--;
print_ans.pb(v[i]);
break;
}
}
for(--i;i>0 && temp ;i--)
{
if(v[i]<print_ans.back() && L[i]==temp)
{
print_ans.pb(v[i]);
temp--;
}
}
printf("%d\n-\n",ans);
for(i=ans-1;i>=0;i--)
printf("%d\n",print_ans[i]);
return 0;
}
|