Pagini recente » Cod sursa (job #2959777) | Cod sursa (job #686562) | Cod sursa (job #2971413) | Cod sursa (job #500956) | Cod sursa (job #524526)
Cod sursa(job #524526)
#include <fstream>
using namespace std;
#define dim 10001
int v[dim], best[dim];
int main()
{
ifstream fin("culmi.in");
ofstream fout("culmi.out");
int n, i, j;
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
best[1]=v[1];
int contor=1;
for(i=2;i<=n;++i)
{
int nr=0;
for(j=contor;j>=1;--j)
{
if(v[i]>best[j])
if(best[j]>nr)
nr=best[j];
}
if(nr!=0)
{
int gasit=0;
j=0;
while(gasit==0)
{
if(nr==best[j])
{best[j]=v[i];gasit=1;}
++j;
}
}
else
{
++contor;
best[contor]=v[i];
}
}
fout<<contor;
return 0;
}