Cod sursa(job #3304698)
| Utilizator | Data | 26 iulie 2025 11:31:36 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
long long v[1000005];
int main(){
long long sum=0, n, subm=0,x,maxi=-9999999999999,k,inc,poz1,poz2;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>v[i];
subm+=v[i];
if(i-k>=1){
subm-=v[i-k];
}
sum+=v[i];
if(sum<subm){
sum=subm;
poz1=i-k+1;
}
if(sum>maxi && i>=k){
maxi=sum;
poz2=i;
inc=poz1;
}
}
cout<<inc<<" "<<poz2<<" "<<maxi;
}
