Cod sursa(job #2567399)
| Utilizator | Data | 3 martie 2020 17:02:08 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int x[50001];
int pi,pf;
int main()
{
int n,k;
fin>>n>>k;
int val;
for(int i=1;i<=n;i++)
{
fin>>val;
x[i]=x[i-1]+val;
}
long sumMax=LLONG_MIN;
long sumMin=LLONG_MAX;
for(int i=k;i<=n;i++)
{
if(sumMin>x[i-k])
{
sumMin=x[i-k];
pi=i-k+1;
}
if(sumMax<x[i]-x[pi-1])
{
sumMax=x[i]-x[pi-1];
pf=i;
}
}
fout<<pi<<" "<<pf<<" "<<sumMax;
return 0;
}
