Pagini recente » Cod sursa (job #3160592) | Cod sursa (job #418652) | soldiers | Cod sursa (job #1432700) | Cod sursa (job #1130841)
#include<fstream>
using namespace std;
int main()
{
int n, i, sum, max, x[50001], k, gal, lag, sum1, max1;
ifstream g("secv2.in");
ofstream f("secv2.out");
g >> n >> k;
for (i = 0; i < n; i++)
g >> x[i];
sum = x[0];
max = x[0];
for (i = 1; i < n; i++)
{
if (sum + x[i]>max)
{
max = sum + x[i];
gal = i;
}
if (sum + x[i] >= x[i])
sum += x[i];
else
{
sum = x[i];
lag = i;
}
}
if (gal - lag < k)
{
max = x[lag+1];
sum = x[lag+1];
for (i = lag + 1; i < n; i++)
{
if (sum + x[i]>max)
{
max = sum + x[i];
gal = i;
}
if (sum + x[i] > x[i])
sum += x[i];
else
{
sum = x[i];
lag = i;
}
}
}
f << lag+1 << " " << gal+1 << " " << max;
}