Pagini recente » Cod sursa (job #1211876) | Monitorul de evaluare | Cod sursa (job #1539094) | Cod sursa (job #2306446) | Cod sursa (job #768020)
Cod sursa(job #768020)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int main()
{
int n,k,i,v[50001],st=1,sumMax = 0,sum=0,stmax,drmax,ok=1;
in>>n>>k;
for(i=1;i<=n;i++){
in>>v[i];
if(v[i] > 0) ok=0;
}
if(!ok)
for(i=1;i<=n;i++)
{
if(sum < 0){
st=i;
sum = 0;
}
sum+=v[i];
if(sum > sumMax && i-st+1 > k)
{
sumMax = sum ;
stmax = st ;
drmax = i ;
}
}
else {
for(i=1;i<=n;i++)
sumMax += v[i];
stmax=1;
drmax=i-1;
}
out<<stmax<<" "<<drmax<<" "<<sumMax;
return 0;
}