Cod sursa(job #2844904)
| Utilizator | Data | 6 februarie 2022 09:33:02 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
long long n, i, k, v[500001],mx=0,j,l,p;
int main()
{
fin >> n >> k;
for(i=1;i<=n;i++)
fin >> v[i];
for(i=1;i<=n;i++)
{
j=i+1;
while(v[j]>v[i]) j++;
if(v[i]>mx && j-i>=k)
{
mx=v[i];
l=j-i;
p=i;
}
else if(v[i]==mx && j-i>l)
{
mx=v[i];
l=j-i;
p=i;
}
}
fout << p << " " << p+l-1 << " " << mx;
}
