Cod sursa(job #2486125)
| Utilizator | Data | 2 noiembrie 2019 12:41:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<iostream>
#include<stdio.h>
using namespace std;
struct mama
{
int elem;
}best[100001];
int v[100001], i, j, n, cnt;
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int max = -1;
cin >> n;
for(i = 1; i <= n; i ++)
cin >> v[i];
for(i = 2; i <= n; i ++)
{
cnt = 0;
for(j = i; j >= 1; j --)
{
if(v[i] > v[j])
{
cnt ++;
best[cnt].elem = v[j];
}
if(max < cnt)
max = cnt;
}
}
cout << max;
return 0;
}
