Pagini recente » Cod sursa (job #2296437) | Cod sursa (job #68511) | Cod sursa (job #3162254) | Cod sursa (job #1459443) | Cod sursa (job #3005287)
#include <fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
const int dim = 50000 + 5;
int v[dim], sp[dim];
int main()
{
int n, i, j, k;
cin >> n >> k;
for ( i = 1; i <= n; ++i )
{
cin >> v[i];
sp[i] = sp[i - 1] + v[i];
}
int maxim = -1, a, b, s;
long long nr;
for (i = 1; i <= n; ++i )
for ( j = n; j >= i + k - 1; --j )
{
nr = sp[j] - sp[i - 1];
if ( maxim < nr )
{
maxim = nr;
a = i;
b = j;
}
}
cout << a << " " << b << " " << maxim << endl;
return 0;
}