Mai intai trebuie sa te autentifici.
Cod sursa(job #594268)
| Utilizator | Data | 6 iunie 2011 20:51:13 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include<fstream>
using namespace std;
#define IN "scmax.in"
#define OUT "scmax.out"
#define MaxN 100001
FILE *f=fopen(IN,"r"), *g=fopen(OUT,"w");
long long a[MaxN], l[MaxN], i, j, maxim, n, poz, max2;
int main()
{
fscanf(f,"%lld", &n);
for(i=1; i<=n; ++i)
fscanf(f,"%lld", &a[i]);
l[n]=1;
max2=0;
for(j=n-1; j>=1; --j)
{
maxim=0;
for(i=j+1; i<=n; i++)
{
if(a[i]>a[j] && l[i]>maxim)
maxim=l[i];
}
l[j]=maxim+1;
if(l[j]>max2)
{
max2=l[j];
poz=j;
}
}
fprintf(g,"%lld\n",max2);
fprintf(g,"%lld ",a[poz]);
max2--;
for(i=poz; i<=n; i++)
{
if(l[i]==max2)
{
fprintf(g,"%lld ",a[i]);
max2--;
}
}
fclose(f);
fclose(g);
exit(0);
}