Pagini recente » Clasament fjj | Cod sursa (job #2969475) | Istoria paginii runda/fjj | Cod sursa (job #1745900) | Cod sursa (job #2078041)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,i,p,v[50005],s,mx=-1000000000,p1,p2,s1,sp;
int main()
{fin>>n>>k;
p=0;
for(i=1;i<=n;i++)
{fin>>v[i];s+=v[i];
if(i-k>p)
{s1+=v[i-k];
if(s1<0&&s1<sp){p=i-k;sp=s1;}
if(s-sp>mx){mx=s-sp;p1=p+1;p2=i;}
//fout<<s<<" "<<sp<<"\n";
}
else if(i-k==p){p1=1;p2=i;mx=s;}
}
fout<<p1<<" "<<p2<<" "<<mx;
}