Pagini recente » Cod sursa (job #2580482) | Cod sursa (job #20248) | Cod sursa (job #3169482) | Cod sursa (job #835676) | Cod sursa (job #1525965)
#include<fstream>
using namespace std;
int n,k,i,max1,dr,st;
int a[50005],s[50005],mn[50005];
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
for(i=1;i<=n;i++)
if(s[i]<s[mn[i-1]])
mn[i]=i;
else
mn[i]=mn[i-1];
max1=-999999;
for(i=k;i<=n;i++)
if(s[i]-s[mn[i-k]]>max1)
{
max1=s[i]-s[mn[i-k]];
dr=i;
st=mn[i-k]+1;
}
g<<st<<" "<<dr<<" "<<max1;
return 0;
}