Cod sursa(job #2709669)
| Utilizator | Data | 20 februarie 2021 21:27:46 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("secventa.in");
ofstream cout( "secventa.out");
int a[1000001];
int main()
{
int n, k, st, dr, max = -1000000;
cin >> n >> k;
for(int i = 1; i <= n; ++i)
cin >> a[i];
for(int i = 1; i <= n - k + 1; ++i){
if(a[i] > max)
max = a[i], st = i, dr = i + k - 1;
}
cout << st << ' ' << dr << ' ' << max;
return 0;
}
