Pagini recente » Cod sursa (job #2799021) | Cod sursa (job #1970716) | Cod sursa (job #1611171) | Cod sursa (job #696386) | Cod sursa (job #2440039)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int n,k;
in>>n>>k;
int vec[n+1];
vec[0]=0;
int maxsuma=vec[k],inceput=1,sfarsit=k;
int m=0;
for(int i=1; i<=n; i++)
{
int a;
in>>a;
vec[i]=vec[i-1]+a;
}
for(int i=1;i<=n-k;i++)
{
m=min(m,vec[i+k]);
if(m==vec[i])
inceput=i+1;
if(vec[i+k]-m>maxsuma)
{
maxsuma=vec[i+k]-m;
sfarsit=i+k;
}
}
out<<inceput<<" "<<sfarsit<<" "<<maxsuma;
return 0;
}