Pagini recente » Cod sursa (job #3239253) | Cod sursa (job #1818972) | Cod sursa (job #1211072) | Cod sursa (job #421570) | Cod sursa (job #2667645)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int n, st, dr, k;
int v[50001], s[50001];
fin >> n >> k;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
s[i] = s[i - 1] + v[i];
}
int sc = s[k - 1], start = 1, smax = -(1<<29);
for(int i = k; i <= n; i++)
{
sc += v[i];
if(s[i] - s[i - k] > sc)
{
start = i - k + 1;
sc = s[i] - s[i - k];
}
if(sc > smax)
{
smax = sc;
st = start;
dr = i;
}
}
fout << st << ' ' << dr <<' '<< smax;
fin.close();
fout.close();
return 0;
}