Pagini recente » Borderou de evaluare (job #1835431) | Minimal Enclosing Circle | Borderou de evaluare (job #1529806) | Borderou de evaluare (job #1930999) | Cod sursa (job #676904)
Cod sursa(job #676904)
#include<fstream>
using namespace std;
long n,k,sum,max1,st=1,sf,in,i,a[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(sum<=0)
{
sum=a[i];
st=i;
}
else
sum=sum+a[i];
if(max1<sum && i-st>=k)
{
sf=i;
in=st;
max1=sum;
}
}
g<<in<<" "<<sf<<" "<<max1;
}