Pagini recente » Cod sursa (job #3332084) | Cod sursa (job #3344087) | Cod sursa (job #3342166) | Cod sursa (job #3333453) | Cod sursa (job #3324641)
#include <fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int n, k;
int v[50005];
long long sp[50005];
int main()
{
cin>>n>>k;
for(int i = 1; i<=n; i++)
{
cin>>v[i];
sp[i] = sp[i - 1] + (long long)v[i];
}
long long smax = sp[k];
int st = 1;
int dr = k;
int poz = 1;
for(int i = k; i<=n; i++)
{
if(sp[i - k] < sp[poz - 1])
{
poz = i - k;
}
long long sum = (long long)sp[i] - (long long)sp[poz - 1];
if(sum > smax)
{
smax = sum;
st = poz;
dr = i;
}
}
cout<<st<<" "<<dr<<" "<<smax;
return 0;
}