Cod sursa(job #587838)
Utilizator | szabo david emanuel david95 | Data | 6 mai 2011 09:28:34 |
---|---|---|---|
Problema | Secv | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream fin("secv.in");
ofstream fout("secv.out");
int main()
{
int a[100], n, l[100], i, j, max =-444;
fin >> n;
for ( i = 0; i < n; i++ )
fin >> a[i];
for ( i = 0; i < n; i++ )
{
l[i] = 1;
for ( j = 0; j < i; j++ )
if ( a[i] > a[j] && a[i] > a[i-1] && l[i] < l[j] + 1 )
l[i] = l[j] + 1;
}
for ( i = 0; i < n; i++ )
if ( l[i] > max )
max = l[i];
fout << max;
fin.close();
fout.close();
}