Pagini recente » Clasament Summer Challenge 2007, Runda 2 | Istoria paginii preoni-2006/runda-1 | Clasament Summer Challenge 2007, Runda 3 | Solutii preONI 2006 - Runda 1 | Cod sursa (job #1569128)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,s,mx,c1,c2,v[50005];
int main()
{
f >> n >> k;
for(i = 1; i <= n; ++i)
f >> v[i];
mx = -99999999;
while(k <= n)
{
s = 0;
for(i = 1; i <= k; ++i)
s += v[i];
if(s > mx)
{
mx = s;
c1 = i;
c2 = i + k - 1;
}
for(i = 2; i <= n - k + 1; ++i)
{
s -= v[i-1];
s += v[i + k - 1];
if(s > mx)
{
mx = s;
c1 = i;
c2 = i + k - 1;
}
}
++k;
}
if(s > mx)
{
mx = s;
c1 = i;
c2 = i + k - 1;
}
g << c1 << " " << c2 << " " << mx << '\n';
return 0;
}