Cod sursa(job #2541369)
| Utilizator | Data | 8 februarie 2020 12:59:15 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.81 kb |
#include <fstream>
using namespace std;
int n,i,st,dr,mid,L,V[100010],t[100010],D[100010];
ifstream fin("scmax.in");
ofstream fout("scmax.out");
void T(int i)
{
if(i!=0)
{
T(t[i]);
fout<<V[i]<<" ";
}
}
int main() {
fin>>n;
for (i=1;i<=n;i++)
fin>>V[i];
L=1;
D[1]=1;
for(i=2;i<=n;i++)
{
st=1;
dr=L;
while(st<=dr)
{
mid=(st+dr)/2;
if(V[D[mid]]>=V[i])
dr=mid-1;
else
st=mid+1;
}
if(st>L)
{
L++;
D[L]=i;
t[i]=D[st-1];
}
else
{
D[st]=i;
t[i]=D[st-1];
}
}
fout<<L<<"\n";
T(D[L]);
return 0;
}
