Cod sursa(job #2756737)
| Utilizator | Data | 2 iunie 2021 18:29:31 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
#define nmax 50005
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
long long n, k, pozmin, smin , suma=-2500000000005, beg, en;
long long v[nmax], s[nmax];
int main()
{
in>>n>>k;
for(int i=1; i<=n; i++)
{
in>>v[i];
s[i] = s[i-1] +v[i];
}
for(int i=k; i<=n; i++)
{
if(suma < s[i] - smin)
{
suma = s[i]-smin;
en = i;
beg = pozmin+1;
}
if(s[i-k+1] < smin)
{
smin = s[i-k+1];
pozmin = i-k+1;
}
}
out<<beg<<" "<<en<<" "<<suma;
return 0;
}
