Pagini recente » Cod sursa (job #2294091) | Cod sursa (job #2651838) | Cod sursa (job #2281119) | Cod sursa (job #2578208) | Cod sursa (job #2325730)
#include <fstream>
#include <climits>
using namespace std;
int v[6000005], n, i, start, stop, summax = INT_MIN, minsum, k, j;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f >> n >> k;
for(i = 1; i <= n; i ++)
{
f >> v[i];
v[i] += v[i - 1];
if (summax < v[i] - minsum && i > k)
{
summax = v[i] - minsum;
start = j + 1;
stop = i;
}
if(minsum > v[i])
{
minsum = v[i];
j = i;
}
}
if(k == n) g << 1 << " " << n << " " << v[n];
else g << start << " " << stop << " " << summax;
return 0;
}