Pagini recente » Cod sursa (job #1646366) | Cod sursa (job #1792687) | Cod sursa (job #2327679) | Cod sursa (job #1587783) | Cod sursa (job #1621830)
#include <iostream>
#include <fstream>
#include <string.h>
#include <cstdio>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long long sum[50001];
int main()
{
int i,n,k,in,a,x,y;long long max1,min1 ;int j,x1,y1;
f>>n>>k;max1=-25000001;
for(i=1;i<=n;i++)
{f>>a;sum[i]=sum[i-1]+a;}
for(i=k;i<=n;i++)
{
min1=25000001;
for(j=i-k+1;j>=1;j--)
if(min1>sum[j-1]){min1=sum[j-1]; x=j; y=i;}
if(max1<sum[i]-min1)
{max1=sum[i]-min1; x1=x; y1=y;}
}
g<<x1<<" "<<y1<<" "<<max1;
return 0;
}