Cod sursa(job #230496)
Utilizator | Stefan Neculai St3faN | Data | 14 decembrie 2008 01:33:04 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
fstream f,g;
long int n, a[100000];
long int l[100000];
void look_back(long poz)
{
for(long i=1;i<poz;i++)
if(a[i]<a[poz]&&l[poz]<=l[i])
l[poz]=l[i]+1;
}
int main()
{
f.open("scmax.in",ios::in);
g.open("scmax.out", ios::out);
f>>n;
long maxim=0;
for(long i=1;i<=n;i++)
{
f>>a[i];
l[i]=1;
look_back(i);
if(l[i]>maxim)
maxim=l[i];
}
g<<maxim;
return 0;
}