Cod sursa(job #2210059)
Utilizator | Data | 5 iunie 2018 15:59:33 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int v[100], n;
int t[100];
int _max;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=2; i<=n; i++)
for(int j=1; j<i; j++)
if(v[i]>v[j])
t[i]=max(t[i], t[j]+1);
for(int i=1; i<=n; i++)
if(t[i]>_max) _max=t[i];
g<<_max+1;
return 0;
}