Cod sursa(job #2940154)
Utilizator | Data | 14 noiembrie 2022 22:03:41 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | cnilc1_2-dq | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,p,i,MIN,MAX,rez1,rez2,rez3,v[500005];
int main()
{
f>>n>>k;
p=1;
for(i=1;i<=n;i++){
f>>v[i];
}
for(i=1;i<=n-k+1;i++)
{MIN=min(v[i],min(v[i+1],v[i+2]));
if(MIN>MAX)
{MAX=MIN;
rez1=i;
rez2=i+k-1;
rez3=MAX;}
}
g<<rez1<<" "<<rez2<<" "<<rez3;
return 0;
}