Pagini recente » Cod sursa (job #2320975) | Cod sursa (job #1789114) | Cod sursa (job #1038995) | Cod sursa (job #871250) | Cod sursa (job #1415913)
#include <fstream>
#include <limits>
using namespace std;
ifstream F("secv2.in");
ofstream G("secv2.out");
int main()
{
int n, S, k;
int sum = 0, best = numeric_limits<int>::min(), beg, en, idx = 0;
F >> n >> k;
for(int i = 1; i<=n; i++)
{
F >> S;
if(sum < 0)
sum = S, idx = i;
else
sum += S;
if(best < sum)
{
beg = idx, en = i;
if(en-beg >= k)
best = sum;
}
}
G << beg << " " << en << " " << best;
F.close(), G.close();
return 0;
}