Pagini recente » Cod sursa (job #2948549) | Cod sursa (job #2120743) | Cod sursa (job #1904579) | Cod sursa (job #2780053) | Cod sursa (job #1097940)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,nr,v[100099],l[100099],maxx,xinceput;
int main()
{
f>>n;
for (int i=1; i<=n; ++i) f>>v[i], l[i]=1;
l[n]=1;
maxx=0; v[0]=2000000999;
for (int i=n-1; i>0; --i)
for (int j=i+1; j<=n; ++j)
if (v[i]<v[j] && l[i]<l[j]+1)
{
l[i]=l[j]+1;
if (l[i]>maxx) maxx=l[i];
}
//for (int i=1; i<=n; ++i) g<<l[i]<<' ';
g<<maxx<<'\n';
g.close(); f.close();
return 0;
}