Pagini recente » Cod sursa (job #520130) | Cod sursa (job #896474) | Cod sursa (job #424629) | Cod sursa (job #1665845) | Cod sursa (job #1464718)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[50000], sum[50000];
int n, k, i, j;
int maxim=INT_MIN;
int poz_i, poz_f;
int main()
{
f >> n >> k;
for (i=0; i<n; i++)
{
f >> a[i];
sum[i] = sum[i-1]+a[i];
}
for (i=0; i<n; i++)
{
for (j=i+k-1; j<n; j++)
if (sum[j]-sum[i-1] > maxim )
{
maxim = sum[j]-sum[i-1];
poz_i = i+1;
poz_f = j+1;
}
}
g << poz_i << " " << poz_f << " " << maxim;
return 0;
}