Pagini recente » Cod sursa (job #43161) | Cod sursa (job #64252) | Cod sursa (job #95332) | Cod sursa (job #882469) | Cod sursa (job #1516002)
#include <fstream>
using namespace std;
const int nmax=50005;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[nmax],s[nmax],mn[nmax];
int main()
{
int n,k;
f>>n>>k;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
for(int i=1;i<=n;i++)
if(s[i]<s[mn[i-1]])
mn[i]=i;
else
mn[i]=mn[i-1];
int maax=-999999,dr,st;
for(int i=k;i<=n;i++)
if(s[i]-s[mn[i-k]]>maax)
{
maax=s[i]-s[mn[i-k]];
dr=i;
st=mn[i-k]+1;
}
g<<st<<" "<<dr<<" "<<maax;
return 0;
}