Pagini recente » Cod sursa (job #2267596) | Cod sursa (job #1354647) | Cod sursa (job #2620684) | Cod sursa (job #1047789) | Cod sursa (job #877215)
Cod sursa(job #877215)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i, j, n, LungMax, v[100005], lung[100005];
int main() {
fin >> n;
for (i = 0; i < n; ++i)
fin >> v[i];
fin.close();
for (i = n - 2; i >= 0; --i) {
for (j = i + 1; j < n; ++j) {
if (v[i] < v[j] && lung[i] < lung[j] + 1)
lung[i] = lung[j] + 1;
}
if (LungMax < lung[i])
LungMax = lung[i];
}
fout << LungMax + 1;
fout.close();
return 0;
}