Cod sursa(job #1583979)
Utilizator | Data | 29 ianuarie 2016 16:29:49 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[100007],x[100007],p,n,j,i,t[100007],m,u,s;
void afis(int m)
{
if(m)
{
afis(t[m]);
g<<a[m]<<" ";
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
x[1]=1;
s=1;
for(i=2;i<=n;i++)
{
p=1;
u=s;
while(p<=u)
{
m=(u+p)/2;
if(a[i]>a[x[m]])
p=m+1;
else
u=m-1;
}
if(p>s)
s++;
x[p]=i;
t[i]=x[p-1];
}
g<<s<<"\n";
afis(x[s]);
return 0;
}