Cod sursa(job #2304890)
Utilizator | Data | 18 decembrie 2018 19:16:15 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,j,v[100010],D[100010],k,st,mid,T[100010],dr,u;
void afis(int u){
if(u){
afis(T[u]);
fout<<v[u]<<" ";
}
}
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
D[1]=1;
k=1;
for(i=2;i<=n;i++){
st=1;
dr=k;
while(st<=dr){
mid=(st+dr)/2;
if(v[D[mid]]<v[i])
st=mid+1;
else
dr=mid-1;
}
if(st>k){
D[++k]=i;
T[i]=D[st-1];
}else{
D[st]=i;
T[i]=D[st-1];
}
}
fout<<k<<"\n";
afis(D[k]);
return 0;
}