Cod sursa(job #2740145)
Utilizator | Gabriel Dascalescu Gabriel_Dascalescu | Data | 11 aprilie 2021 16:49:03 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
#define nmax 50005
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
long long v[nmax];
long long n, beg, en, k, smin, pozmin;
long long s[nmax], rasp=-2500000000005;
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(rasp<s[i]-smin)
{
rasp = 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<<" "<<rasp;
return 0;
}