Cod sursa(job #2431009)
| Utilizator | Data | 17 iunie 2019 17:42:04 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int x,i,n,k,pi,pf,p;
long long sp[50001],s,smax=INT_MIN;
int main()
{
fin>>n>>k;
for(i=1;i<=n;++i)
{
fin>>x;
sp[i]=sp[i-1]+x;
}
for(i=k;i<=n;++i)
{
if(sp[i-k]<s) s=sp[i-k], p=i-k+1;
if(sp[i]-s>smax)
{
smax=sp[i]-s;
pi=p;
pf=i;
}
}
fout<<pi+1<<" "<<pf<<" "<<smax;
return 0;
}
