Cod sursa(job #2337518)
| Utilizator | Data | 6 februarie 2019 15:06:10 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#define NM 50001
#define ll long long
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
ll n,k,i,p,pi,pj,maxs,il,s;
ll a[NM];
int main()
{
f>>n>>k;
maxs=0-(1<<30);
for(i=1;i<=n;i++) { f>>a[i]; }
s=a[1]; il=1;
for(i=2;i<=n;i++){
if(s+a[i]<a[i]) { s=a[i]; il=i; }
else s+=a[i];
if(i-il+1>=k&&maxs<s) { maxs=s; pi=il; pj=i; }
}
g<<pi<<' '<<pj<<' '<<maxs;
return 0;
}
