Pagini recente » Cod sursa (job #2077230) | Cod sursa (job #3224609) | Cod sursa (job #1765709) | Cod sursa (job #1059867) | Cod sursa (job #1845599)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fi("secv2.in");
ofstream fo("secv2.out");
int n,x,y,sum,bst,ind,st,sf,i,k,A[50001];
int main()
{
bst=-1000000000;
fi>>n>>k;
for(i=1; i<=n; i++)
{
fi>>x;
A[i]=A[i-1]+x;
}
st=1;
sf=k;
sum=A[k];
for(i=k+1; i<=n; i++)
{
if((A[i]-A[i-k])>(sum+A[i]-A[i-1]))
{
st=i-k+1;
sf=i;
sum=A[i]-A[i-k];
}
else
{
sum=sum+A[i]-A[i-1];
sf=i;
}
if(bst<sum)
{
bst=sum;
x=st;
y=sf;
}
}
fo<<x<<" "<<y<<" "<<bst;
fi.close();
fo.close();
return 0;
}