Pagini recente » Cod sursa (job #915217) | Cod sursa (job #2009470) | Cod sursa (job #44048) | Cod sursa (job #2969342) | Cod sursa (job #1955058)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
short numere[50001],corect=false;
long long suma[50001],smax=-2000000000;
int n,k;
int beg,fin;
int inc=1;
f>>n>>k>>numere[1];
suma[1]=numere[1];
for(int i=2;i<=n;i++)
f>>numere[i],suma[i]=suma[i-1]+numere[i];
for(int i=k+1;i<=n;i++)
{
if(suma[inc]>suma[i-k])inc=i-k;
if(suma[i]-suma[inc]>smax)smax=suma[i]-suma[inc],beg=inc,fin=i;
}
g<<beg+1<<" "<<fin<<" "<<smax<<"\n";
f.close();
g.close();
return 0;
}