Cod sursa(job #3176957)
Utilizator | Mirel Costel unom | Data | 28 noiembrie 2023 09:51:09 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, k;
int sp[50005];
int main()
{
in>>n>>k;
int x;
for(int i = 1; i<=n; i++)
{
in>>x;
sp[i] = sp[i-1] + x;
}
int smin = 0;
int smax = sp[k];
int poz = 1;
int st = 1;
int dr = k;
for(int i = k + 1; i<=n; i++)
{
if(sp[i-k] < smin)
{
smin = sp[i - k];
poz = i - k + 1;
}
if(sp[i] - smin > smax)
{
smax = sp[i] - smin;
st = poz;
dr = i;
}
}
out<<st<<" "<<dr<<" "<<smax;
return 0;
}