Pagini recente » Cod sursa (job #765211) | Cod sursa (job #470606) | Cod sursa (job #2120086) | Borderou de evaluare (job #791569) | Cod sursa (job #1956704)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
long long n,nr,suma=0,maxim=INT_MIN,capat1=1,k,capat2=1,pis=1, sumat=0;
fin>>n>>k;
if(n==k)
{
capat1=1;
capat2=n;
}
fin>>nr;
suma+=nr;
sumat+=nr;
maxim=suma;
for(int i=2;i<=n;i++){
fin>>nr;
sumat+=nr;
if(nr>suma+nr){
suma=nr;
pis=i;
}else{
suma=suma+nr;
}
if(suma>maxim && i-pis+1>=k){
maxim=suma;
capat1=pis;
capat2=i;
}
}
if(n==k)
fout<<capat1<<" "<<capat2<<" "<<sumat;
else
fout<<capat1<<" "<<capat2<<" "<<maxim;
return 0;
}