Pagini recente » Cod sursa (job #194158) | Cod sursa (job #1127415) | Cod sursa (job #230057) | Cod sursa (job #539258) | Cod sursa (job #2602849)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
int n,k=0,x, sum=0, bestsum=-int(2e9), contor=0, idx,p,u;
f >> n >> k;
for (int i=1; i<=n; i++)
{
f >> x;
if (sum<0)
{
sum = x;
idx=i;
contor=1;
}
else
{
sum += x;
contor++;
}
if(bestsum<sum && contor>=k)
{
bestsum=sum;
p = idx;
u = i;
}
}
g << p << " " << u << " " << bestsum;
return 0;
}