Mai intai trebuie sa te autentifici.
Cod sursa(job #2972124)
| Utilizator | Data | 28 ianuarie 2023 18:09:05 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.92 kb |
#include <fstream>
using namespace std;
int v[100005],best[100005];
int main()
{
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
best[1]=v[1];
int cnt=1;
for(int i=2;i<=n;i++)
{
int st=1,dr=cnt;
if(v[i]>best[cnt])
best[++cnt]=v[i];
else
{
int retin=0;
while(st<=dr)
{
int mij=(st+dr)/2;
if(best[mij]<=v[i])
{
retin=mij;
st=mij+1;
}
else
dr=mij-1;
}
if(retin==0)
best[1]=v[i];
else
best[retin]=v[i];
}
}
cout<<cnt<<'\n';
for(int i=1;i<=cnt;i++)
cout<<best[i]<<" ";
return 0;
}
