Pagini recente » Cod sursa (job #598972) | Cod sursa (job #1749889) | Cod sursa (job #2631379) | Cod sursa (job #1687712) | Cod sursa (job #2350664)
#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=0;
for(int j=i-1; j>=1; j--)
{
if(sir[i]>sir[j])
aux=max(aux,d[j]);
}
if(aux==0)
d[i]=1;
else
d[i]=aux+1;
cout<<sir[i]<<" "<<d[i]<<endl;
maxim=max(d[i],maxim);
}
g<<maxim<<endl;
return 0;
}