Cod sursa(job #2350644)
| Utilizator | Data | 21 februarie 2019 16:55:33 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 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;
d[0]=1;
sir[0]=INT_MAX;
for(int i=2,j; i<=n; i++)
{
j=i;
while(sir[i]<=sir[j])
{
j--;
}
if(j==0)
d[i]=1;
else
{
d[i]=d[j]+1;
}
maxim=max(d[i],maxim);
}
g<<maxim<<endl;
return 0;
}
