Pagini recente » Cod sursa (job #1292513) | Cod sursa (job #2322452) | Cod sursa (job #3256489) | Cod sursa (job #352048) | Cod sursa (job #1207442)
#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(v[i]>sum+v[i])
{
sum=v[i];st=i;dr=i;
}
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();
}