Pagini recente » Cod sursa (job #1430183) | Cod sursa (job #455031) | Cod sursa (job #1899568) | Cod sursa (job #2816148) | Cod sursa (job #1723314)
#include<fstream>
using namespace std;
ifstream fi("secv2.in");
ofstream fo("secv2.out");
int n,k,i,sum,idx,bestSum,beg,end,A[50001];
int main()
{
fi>>n>>k;
for(i=1; i<=n; i++)
fi>>A[i];
bestSum=-int(2e9);
sum=0;
for(i=1; i<=n; i++)
{
if(sum<0 && i<=n-k+1)
{
sum=A[i];
idx=i;
}
else
sum+=A[i];
if(bestSum<sum && i-idx+1>=k)
{
bestSum=sum;
beg=idx;
end=i;
}
}
fo<<beg<<" "<<end<<" "<<bestSum<<"\n";
fi.close();
fo.close();
return 0;
}