Pagini recente » Cod sursa (job #788377) | Cod sursa (job #269541) | Cod sursa (job #2548366) | Cod sursa (job #2061892) | Cod sursa (job #2938141)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,i,a[25001],c,x,k,ks;
long int v[25001],v1[25001],s,smax=-1250000001,z[25001];
int main()
{
in>>n>>k;
for(i=1;i<=n;i++)
{in>>a[i];
v[i]=v[i-1]+a[i];
}
v1[1]=v[1];
z[v1[1]]=1;
for(i=2;i<=n+1;i++)
{if(v[i]<v1[i-1])
{v1[i]=v[i];
z[i]=i;}
else
{v1[i]=v1[i-1];
z[i]=z[i-1];
}
}
for(i=k;i<=n;i++)
{
s=v[i]-v1[i-k+1];
if(s>smax)
{
x=z[i-k+1]+1;
c=i;
smax=s;
}
}
out<<x<<" "<<c<<" "<<smax;
return 0;
}