Pagini recente » Cod sursa (job #1922262) | Cod sursa (job #2724077) | Cod sursa (job #2765114) | Cod sursa (job #2809819) | Cod sursa (job #652307)
Cod sursa(job #652307)
#include<fstream>
using namespace std;
long long maxx=-0x3f3f3f3f;
int main()
{ifstream f("secv2.in");
ofstream h("secv2.out");
int a,n,k,d[50000],i,j,p,u;
f>>n>>k;
f>>d[1];
for(i=2;i<=n;i++)
{f>>a;
d[i]=d[i-1]+a;}
d[0]=0;
for(i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n;j++)
if(d[j]-d[i-1]>maxx)
{maxx=d[j]-d[i-1];
p=i;
u=j;}
h<<p<<" "<<u<<" "<<maxx;
return 0;}