Pagini recente » tema | Cod sursa (job #2342697) | Cod sursa (job #810677) | Cod sursa (job #987399)
Cod sursa(job #987399)
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int i,j,a[1000],Max,l[1000],n,mx,poz,x,pz,Min;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
l[n]=1;
for(i=n-1; i>=1; i--)
{
Max=0;
for(j=i+1; j<=n; j++)
if(a[i]<a[j] && l[j]>Max)
Max=l[j];
l[i]=Max+1;
if(l[i]>mx)
{
mx=l[i];
poz=i;
}
}
g<<mx<<endl;
g<<a[poz]<<" ";
x=a[poz];
mx--;
for(i=poz+1; i<=n; i++)
if(a[i]>x && l[i]==mx)
{
g<<a[i]<<" ";
x=a[i];
mx--;
}
return 0;
}