Pagini recente » Cod sursa (job #1478747) | Cod sursa (job #306367) | Cod sursa (job #2741900) | Cod sursa (job #1550917) | Cod sursa (job #2464705)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int n,x,v[5010],d[5010];
int main()
{
f>>n;
int max1 = -1;
for(int i=1;i<=n;i++){
f>>v[i];
}
int inde;
for(int i=1;i<=n;i++){
for(int j=i-1;j>=1;j--){
if(v[j] < v[i]){
d[i] = max(d[i],d[j]+1);
}
}
if(max1 < d[i]){
max1 = d[i];
inde = i;
}
}
int j = inde;
int prc = d[j];
int nr = 0;
while(prc != 0){
if(d[j-1] == prc-1){
prc = d[j-1];
}
j--;
nr++;
}
g<<nr+1;
}