Cod sursa(job #1728176)
| Utilizator | Data | 12 iulie 2016 13:29:04 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
long long a[100005];
int n,lgmax,siruri;
void Citire()
{
int i;
ifstream fin("crescator.in");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
}
void Rezolvare()
{
int lg=0,i;
siruri=n+1;
lgmax=-1;
for(i=2;i<=n;i++)
{
if(a[i]>a[i-1])
{
lg++;
siruri++;
}
else
{
lg=1;
}
lgmax=max(lgmax,lg);
}
ofstream fout("crescator.out");
fout<<siruri<<" "<<lgmax<"\n";
}
int main()
{
Citire();
Rezolvare();
return 0;
}
