Pagini recente » Cod sursa (job #2076284) | Cod sursa (job #2056306) | Cod sursa (job #2897531) | Cod sursa (job #1267488) | Cod sursa (job #930525)
Cod sursa(job #930525)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,t,inc,sf;
long long s[50001],maxim;
int a[50001];
int main()
{
f>>n;
f>>k;
for(i=1;i<=n;++i) {
f>>a[i];
s[i]=s[i-1]+a[i];
}
maxim=-9999999;
for(i=1;i<=n-k+1;++i)
{
for(t=0;t+i+k-1<=n;++t) {
if(s[i+t+k-1]-s[i-1]>maxim) {
maxim=s[i+t+k-1]-s[i-1];
inc=i;
sf=i+t+k-1;
}
}
}
g<<inc<<" "<<sf<<" "<<maxim;
return 0;
}