Cod sursa(job #898162)
Utilizator | Data | 28 februarie 2013 08:15:43 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,l[100000],d[100];
long long s[100000];
int main()
{
int i,j,maxx,lgmax=0,e=1;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
l[1]=1;
for(i=2;i<=n;i++)
{
maxx=0;
for(j=1;j<=i;j++)
if(s[j]<s[i]&&l[j]>maxx) maxx=l[j];
l[i]=maxx+1;
if(l[i]>lgmax) lgmax=l[i];/*{
lgmax=l[i];
d[e]=i;e++;}*/
}
g<<lgmax<<endl;
/* for(i=1;i<e;i++)
g<<s[d[i]]<<" ";
*/f.close();
g.close();
return 0;
}