Pagini recente » Cod sursa (job #1471698) | Cod sursa (job #2947557) | Cod sursa (job #2085176) | Cod sursa (job #143008) | Cod sursa (job #786664)
Cod sursa(job #786664)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int v[50000],sum[50000];
const int INF = 2000000000;
int main()
{
int n,k,i,j,s,smax=-INF,q=0,st,dr;
in >> n >> k;
for(i=0 ; i<n ; i++)
in >> v[i];
s=0;
for(i = 1 ; i < n ; i++)
sum[i] = v[i] + sum[i-1];
for(i = 0 ; i < n ; i++)
{
if(sum[i] - sum[i-k] > s + v[i])
{
s = sum[i] - sum[i-k];
j = i - k + 1;
}
else
s += v[i];
if(s > smax)
{
smax = s;
st = j;
dr = i;
}
}
out << st+1 <<" "<< dr+1 << " " << smax << "\n";
return 0;
}