Pagini recente » Cod sursa (job #2867724) | Cod sursa (job #3261290) | Cod sursa (job #1076271) | Cod sursa (job #949503) | Cod sursa (job #1207443)
#include <fstream>
using namespace std;
long int n,k,v[50005],i,j,st,dr,sum,maxim,l,r;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{ f>>v[i];
if(sum+v[i]<=0)
{
sum=0;st=i+1;dr=i+1;
}
else sum+=v[i],dr=i;
if(sum>maxim && dr-st+1>=k)
{
l=st;
r=dr;
maxim=sum;
}
}
g<<l<<" "<<r<<" "<<maxim;
f.close();g.close();
}