Pagini recente » Cod sursa (job #1627354) | Cod sursa (job #2500342) | Cod sursa (job #2481321) | Cod sursa (job #2038654) | Cod sursa (job #669353)
Cod sursa(job #669353)
#include <iostream>
#include <fstream>
using namespace std;
int cost[100001];
int main() {
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100001], i, j, max=1, lungmax=0;
f>>n;
for(i=1; i<=n; i++) f>>a[i];
cost[n]=1;
for(i=n-1; i>=1; i--) {
max=0; cost[i]=1;
for(j=i+1; j<=n; j++) {
if(a[i]<a[j] && cost[j]>max) { max=cost[j]; }
}
cost[i]=max+1;
if(cost[i]>lungmax) { lungmax=cost[i]; }
}
g<<lungmax<<"\n";
// for(i=1; i<=n; i++) g<<cost[i]<<" ";
f.close();
g.close();
return 0;
}