Pagini recente » Cod sursa (job #904649) | Cod sursa (job #2615324) | Cod sursa (job #866952) | Cod sursa (job #1370200) | Cod sursa (job #2398198)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
const int N=50005;
const int INF=-(1<<20);
int n,k;
long long smax=INF,v[N];
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<=n;i++)
v[i]=v[i]+v[i-1];
int j=0,imax,jmax;
for(int i=k;i<=n;i++)
{
if(v[j]>v[i-k])
j=i-k;
if(v[i]-v[j]>smax)
{
smax=v[i]-v[j];
imax=j+1;
jmax=i;
}
}
out<<imax<<' '<<jmax<<' '<<smax;
return 0;
}