Cod sursa(job #1610702)

Utilizator stefy555Stefan stefy555 Data 23 februarie 2016 18:14:19
Problema Subsir crescator maximal Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
FILE* fin=fopen("scmax.in","r");
FILE* fout=fopen("scmax.out","w");
int n,a[100001],b[100001],m;
int main()
{
    fscanf(fin,"%d",&n);
    for(int i=0; i<n; i++)
        fscanf(fin,"%d",&a[i]);
    b[n-1]=1;
    for(int i=n-1;i--;i>=0)
    {
        if(a[i]<a[i+1])
            b[i]=b[i+1]+1;
        else
            if(a[i]==a[i+1])
                b[i]=b[i+1];
            else
            {
                for(int j=i+1;j<n;j++)
                {
                    if(a[i]>a[j])
                    {
                        b[i]=b[j];
                    }
                }
            }
        if(m<b[i])
            m=b[i];
    }
    fprintf(fout,"%d\n",m);
    int k=0;
    while(b[k]!=m)
    {
        k++;
    }
    m--;
    fprintf(fout,"%d ",a[k]);
    while(k<n-1 and m!=0)
    {
        k++;
        if(b[k]==m)
            {fprintf(fout,"%d ",a[k]);m--;}
    }
    return 0;
}