Cod sursa(job #2563021)
| Utilizator | Data | 29 februarie 2020 21:40:05 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int d[100010],cnt,st,dr,mid,t[100010],v[100010],n,i;
void sol(int x){
if(t[x])
sol(t[x]);
fout<<v[x]<<" ";
}
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
st=1; dr=cnt;
while(st<=dr){
mid=(st+dr)/2;
if(v[i]>v[d[mid]])
st=mid+1;
else
dr=mid-1;
}
if(st==cnt+1)
cnt++;
d[st]=i;
t[i]=d[st-1];
}
fout<<cnt<<"\n";
sol(d[cnt]);
return 0;
}
