Cod sursa(job #2474436)
| Utilizator | Data | 15 octombrie 2019 11:17:07 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int sum[50005];
int n,k,smax,p,s,pi,pf;
#define X 2000000000
int main()
{
fin >> n >> k;
smax = -X;
s = X;
for (int i=1;i<=n;i++)
{
fin >> sum[i];
sum[i] = sum[i-1] + sum[i];
}
for (int i=k;i<=n;i++)
{
if (sum[i-k]<s)
{
s = sum[i-k];
p = i-k+1;
}
if (sum[i] - s>smax)
{
smax = sum[i] - s;
pi = p;
pf = i;
}
}
fout << pi << " " << pf << " " << smax << '\n';
return 0;
}
