Pagini recente » Concursul Mihai Patrascu 2013 | Cod sursa (job #1183645) | Cod sursa (job #482674) | Cod sursa (job #2534843) | Cod sursa (job #2215145)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,l,L,R,ans,x,n,best,k,toate;
int main()
{
f>>n>>k;
f>>best;
toate+=best;
ans=best;
l=1;
for(i=2;i<=n;++i)
{
f>>x;
if(best>=0) best+=x;
else l=i, best=x;
if(best>ans && i-l+1>k)
{
ans=best;
L=l;
R=i;
}
toate+=x;
}
if(k==n) g<<"1"<<' '<<n<<' '<<toate<<'\n';
else g<<L<<' '<<R<<' '<<ans<<'\n';
return 0;
}