Cod sursa(job #779401)

Utilizator oana_popfmi - pop oana oana_pop Data 17 august 2012 17:09:57
Problema Subsir crescator maximal Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");

int n,best[100003] , a[100003] , mx ,  poz[100003],p;

void solve()
{
     int i , j;
     best[n]=1;
     poz[n]=-1;
     mx=1; p=n;
     for(i=n-1; i>=1; --i)
        {
          best[i]=1;
          poz[i]=-1;      
          for(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]>mx) mx=best[i],p=i;
          }
      }
}
 
 void solutie()
 {
      int i;
      i=p;
      while(i!=-1)
      {
                  g<<a[i]<<" ";
                  i=poz[i];
                  }
}

int main()
{
    f>>n;
    for(int i=1; i<=n; i++) f>>a[i];
    solve();
    g<<mx<<endl;
    solutie();
    return 0;
    
}