Cod sursa(job #2587303)
Utilizator | Floarea Raul-Andrei Floarea_Raul | Data | 22 martie 2020 16:52:03 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50001], Max = -50000*25000, ipoz, jpoz, n, k, Min = 50000*25000, prim;
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
v[i] += v[i-1];
}
for(int i = k; i <= n; i++)
{
if(v[i-k] < Min)
Min = v[i-k], prim = i-k+1;
if(v[i] - Min > Max)
Max = v[i] - Min, ipoz = i, jpoz = prim;
}
fout << jpoz << ' ' << ipoz << ' ' << Max;
return 0;
}