Pagini recente » Cod sursa (job #680727) | Cod sursa (job #1658697) | Cod sursa (job #1768188) | Cod sursa (job #339131) | Cod sursa (job #2669635)
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
struct elem
{
int s,d;
}poz;
int n, m, v[50001], k;
int st, dr;
int sum, sumMax = 50000 * (-25000), sumMin = 50000 * 25000;
int main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
f>>v[i], v[i]+=v[i-1];
for(int i=k; i<=n; i++)
{
if(v[i-k] < sumMin)
{
sumMin = v[i-k];
st = i - k + 1;
}
if(v[i] - sumMin > sumMax)
{
sumMax = v[i] - sumMin;
dr = i;
}
}
g<<st<<" "<<dr<<" "<<sumMax;
return 0;
}