Cod sursa(job #2350661)
| Utilizator | Data | 21 februarie 2019 17:09:58 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int n, sir[200000],d[1000000],maxim=0;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>sir[i];
d[1]=1;
for(int i=2; i<=n; i++)
{
int aux=1;
for(int j=i-1; j>=1; j--)
{
if(sir[i]>sir[j])
aux=max(aux,d[j]);
}
d[i]=aux+1;
cout<<sir[i]<<" "<<d[i]<<endl;
maxim=max(d[i],maxim);
}
g<<maxim-1<<endl;
return 0;
}
