Mai intai trebuie sa te autentifici.
Cod sursa(job #1809272)
Utilizator | Data | 18 noiembrie 2016 19:35:01 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.97 kb |
#include <cstdio>
using namespace std;
FILE *f=fopen("scmax.in","r");
FILE *g=fopen("scmax.out","w");
int n,a[10000],best[10000],max,poz[10000],p;
void Read()
{
fscanf(f,"%i",&n);
for(int i=1;i<=n;i++)
fscanf(f,"%i",&a[i]);
}
void Dinamic()
{
best[n]=1;
poz[n]=-1;
max=1;
p=n;
for(int i=n-1;i>=1;i--)
{
best[i]=1;
poz[i]=-1;
for(int j=i+1;j<=n;j++)
{
if(a[i]<a[j] && best[i] < best[j]+1)
{
best[i] = best[j] + 1;
poz[i] = j;
if(best[i] > max)
{
max=best[i];
p=i;
}
}
}
}
}
void Construct()
{
int i=p;
while(i!=-1)
{
fprintf(g,"%i ",a[i]);
i=poz[i];
}
}
int main()
{
Read();
Dinamic();
fprintf(g,"%i\n",max);
Construct();
return 0;
}