Pagini recente » Cod sursa (job #173578) | Cod sursa (job #3161295) | Cod sursa (job #3297997) | Cod sursa (job #1525806) | Cod sursa (job #469730)
Cod sursa(job #469730)
#include <stdio.h>
#include <vector>
using namespace std;
vector <int> a(50001, 0);
int v[50001], s[50001];
int n, i, j, k, K;
int Max = 1250000001, p1, p2;
int Min = -1250000001;
int main ()
{
FILE *f = fopen ("secv2.in","r");
FILE *g = fopen ("secv2.out","w");
fscanf (f,"%d %d", &n, &K);
for (i=1; i<=n; ++i)
{
fscanf (f,"%d", &v[i]);
s[i] = s[i-1] + v[i];
if (Min > s[i-1])
{
Min = s[i-1];
p2 = i;
}
}
for (i=1; i<=n; ++i)
{
if (Max < s[i] - Min && i - p2 >= K)
{
Max = s[i] - Min;
p1 = i;
}
}
fprintf (g,"%d %d %d", p2, p1, Max);
fclose(g);
fclose(f);
return 0;
}