Cod sursa(job #886670)
Utilizator | Data | 23 februarie 2013 09:41:04 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 45 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001],best[100001],poz[100001],i,k,aux,n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
if(a[i]<best[k])
{
aux=k;
while(a[i]<=best[aux])
aux--;
aux++;
best[aux]=a[i];
poz[i]=aux;
}
else
{
best[++k]=a[i];
poz[i]=k;
}
}
fout<<k;
fout.close();
return 0;
}