Pagini recente » Cod sursa (job #152179) | Cod sursa (job #1897899) | Cod sursa (job #2639859) | Cod sursa (job #49220) | Cod sursa (job #1089304)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int main(){
int i,n,j,a[5005]={},b[5005],c[5005],m=0,pos=0,x,y;
f>>n;
for(i=1; i<=n; ++i){
f>>a[i];
}
for(i=n; i>=1; --i){
for(j=i-1; j>=1; --j){
if(a[i]>a[j]){
if(b[j] < b[i]+1){
b[j]=b[i]+1;
c[j]=i;
}
}
}
if(b[i]>m){
m=b[i];
pos=i;
}
}
x=pos;
while(pos!=0){
y=pos;
pos=c[pos];
}
/*
for(i=1; i<=n; ++i){
g<<c[i]<<" ";
}
*/
if(x==0)
g<<'0';
else
g<<y-x+1;
return 0;
}