Cod sursa(job #1356856)
| Utilizator | Data | 23 februarie 2015 17:01:53 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,j,max=1,V[100000],W[100000];;
ifstream file1;
file1.open("scmax.in");
file1 >> n;
for( i=0 ; i<n ; i++ )
{
file1 >> V[i];
W[i]=1;
}
file1.close();
for( i=(n-1) ; i>=0 ; i-- )
{
for( j=(n-1) ; j>i ; j-- )
{
if( V[i]<V[j] && W[j]==W[i])
{
W[i]++;
}
}
}
for( i=0 ; i<n ; i++ )
{
if(max<W[i])
{
max=W[i];
j=i;
}
}
cout << max << '\n';
return 0;
}
