Cod sursa(job #1649868)
| Utilizator | Data | 11 martie 2016 15:28:16 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
int v[100002],y[100002],z[100002];
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,lung=1,i,j;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
y[1]=v[n];
z[1]=1;
for(i=n-1;i>=1;i--)
{
j=1;
while(j<=lung and y[j]<=v[i])
j+=1;
if(j>lung)
{
lung+=1;
y[lung]=v[i];
z[lung]=1;
}
else
{
y[j]=v[i];
z[j]+=1;
}
}
int maxim=-1;
for(i=1;i<=lung;i++)
if(z[i]>maxim)
maxim=z[i];
g<<maxim<<" ";
f.close();
g.close();
return 0;
}
