Pagini recente » Cod sursa (job #513594) | Cod sursa (job #1613023) | Cod sursa (job #757452) | Cod sursa (job #431198) | Cod sursa (job #2366762)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int x[50005],n,i,mx,k,j,i1,j1;
int main()
{
f>>n>>k;
for(i=1; i<=n; i++)
{
f>>x[i];
if(i>0)
x[i]=x[i-1]+x[i];
}
mx=x[k],i1=1,j1=k;
for(i=1; i<=n; i++)
for(j=i+k-1; j<=n; j++)
if(x[j]-x[i-1]>mx)
mx=x[j]-x[i-1],i1=i,j1=j;
g<<i1<<" "<<j1<<" "<<mx;
return 0;
}