Cod sursa(job #818899)
| Utilizator | Data | 18 noiembrie 2012 11:50:24 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int MAX_N = 100100;
int v[MAX_N];
int pd[MAX_N];
int N;
int main() {
fin >> N;
for (int i = 1; i <= N; ++i) {
fin >> v[i];
}
int result = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 0; j < i; ++j) {
if (v[i] > v[j] && pd[j] + 1 > pd[i]) {
pd[i] = pd[j] + 1;
if (pd[i] > result) {
result = pd[i];
}
}
}
}
fout << result;
return 0;
}