Pagini recente » Cod sursa (job #1056424) | Cod sursa (job #1840394) | Cod sursa (job #216259) | Cod sursa (job #2034575) | Cod sursa (job #2337508)
#include <fstream>
#define NM 50001
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,p,pi,pj,maxs;
int a[NM];
int main()
{
f>>n>>k;
maxs=-25000;
for(i=1;i<=n;i++) { f>>a[i]; a[i]+=a[i-1]; }
for(i=k;i<=n;i++){
if(a[p]>a[i-k]) p=i-k;
if(a[i]-a[p]>maxs) { maxs=a[i]-a[p]; pi=p+1; pj=i; }
}
g<<pi<<' '<<pj<<' '<<maxs;
return 0;
}