Cod sursa(job #2304554)
| Utilizator | Data | 18 decembrie 2018 10:31:14 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,st,dr,mid,k,h;
int v[100010],d[100010],t[100010],s[100010];
int main(){
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
v[++n]=2000000000;
for(int i=1;i<=n;i++){
st=1;
dr=k;
while(st<=dr){
mid=(st+dr)/2;
if(v[i]>v[d[mid]])
st=mid+1;
else
dr=mid-1;
}
if(st>k)
k++;
d[st]=i;
t[i]=d[st-1];
}
while(n!=0){
s[++h]=v[n];
n=t[n];
}
fout<<h-1<<"\n";
for(int i=h;i>=2;i--)
fout<<s[i]<<" ";
return 0;
}
