Pagini recente » Cod sursa (job #2140365) | Cod sursa (job #944660) | Cod sursa (job #1899407) | Cod sursa (job #930428) | Cod sursa (job #300562)
Cod sursa(job #300562)
#include <fstream>
using namespace std;
typedef long long big;
ifstream f("secv.in");
ofstream g("secv.out");
big a[5002];
int n,l[5002],lm,pf=1,pi;
void dinamic()
{
int i,j;
l[1]=1;
for(i=2;i<=n;i++)
{
for(j=1;j<i;j++)
{
if(l[j]>l[i]&&a[i]>a[j])
{
l[i]=l[j];
}
}
l[i]++;
if(lm<l[i])
{
lm=l[i];
pf=i;
}
}
}
void show()
{
int i;
for(pi=pf,i=pf-1;lm>1;i--)
{
if(l[i]==lm-1&&a[i]<a[pi])
{
pi=i;
lm--;
}
}
g<<(pf-pi+1);
}
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
dinamic();
show();
return 0;
}