Cod sursa(job #1013217)
Utilizator | Data | 20 octombrie 2013 16:43:14 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int i, j, n, a[100000], k, x, nr;
int main()
{
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++)
{
k=a[i];
if(x<nr)x=nr;
nr=1;
for(j=i+1;j<=n;j++)
if(a[j]>k)
{
k=a[j];
nr++;
}
}
cout<<x;
cin.close();
cout.close();
return 0;
}