Cod sursa(job #3332583)
| Utilizator | Data | 7 ianuarie 2026 18:30:16 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k;
int a[50005];
int main()
{
int i, minim, smax, p, st, dr;
fin >> n >> k;
for(i = 1; i <= n; i++)
{
fin >> a[i];
a[i] += a[i - 1];
}
smax = a[k]; minim = p = 0;
st = 1; dr = k;
for(i = k + 1; i <= n; i++)
{
if(minim > a[i - k])
{
minim = a[i - k];
p = i - k;
}
if(smax < a[i] - minim)
{
smax = a[i] - minim;
st = p + 1; dr = i;
}
}
fout << st << " " << dr << " " << smax << '\n';
return 0;
}
