Pagini recente » Rating Hamfau Marian (hamfau) | Cod sursa (job #2018570) | Cod sursa (job #1110879) | Cod sursa (job #1776740) | Cod sursa (job #2057117)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
long long s[50000];
int main()
{
int a[50000];
long long smin=9999999999999, smax=-9999999999999;
int n,k,p,c=0;
long long d=0;
f>>n>>k;
p=k;
for(int i=1;i<=n;i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
for(int i=k;i<=n;i++)
if(smax<s[i]){smax=s[i];p=i;}
for(int i=p-k;i>=0;i--)
if(smin>s[i]){smin=s[i];c=i;}
for(int i=c+1;i<=p;i++)
d+=a[i];
g<<c+1<<" "<<p<<" "<<d;
return 0;
}