Cod sursa(job #3361682)
| Utilizator | Data | 27 iulie 2026 18:53:26 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main(){
int n,k,x,p=0,st,dr;
fin>>n>>k;
long long s[50001],mn=0,best=-2100000000;
s[0]=0;
for(int i=1;i<=n;i++){
fin>>x;
s[i]=s[i-1]+x;
}
for(int i=k;i<=n;i++){
if(s[i-k]<mn){
mn=s[i-k];
p=i-k;
}
if(s[i]-mn>best){
best=s[i]-mn;
st=p+1;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<best;
}