Cod sursa(job #3351066)
| Utilizator | Data | 16 aprilie 2026 15:11:03 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int main()
{
int a[100001],aprim[100001],lungcurent=0,lungmax=-1;
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=2;i<=n;i++)
{
if(a[i-1]<=a[i])
lungcurent++;
if(lungcurent>lungmax)
lungmax=lungcurent;
}
cout<<lungmax;
}
