Cod sursa(job #2890990)
| Utilizator | Data | 17 aprilie 2022 12:25:54 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
/*
Problema Secventa 2
Platforma: Infoarena
*/
#include<bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main(){
int n,k,i,a,left=1,right;
int ans = INT_MIN;
int final_left;
long long sp=0,mp=0;
f>>n>>k;
for(i=1;i<=n;++i){
f >> a;
sp += a;
long long val = sp-mp;
if(ans<val && i-left >= k){
ans=val;
right = i;
final_left = left;
}
if(mp != min(mp,sp)){
left=i+1;
}
mp = min (mp,sp);
}
g << final_left << ' ' << right << ' ' << ans;
return 0;
}