Pagini recente » Cod sursa (job #2533692) | Cod sursa (job #2552965) | Cod sursa (job #2620572) | Cod sursa (job #2504801) | Cod sursa (job #2700810)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,n,m,maxim,minim,inceput,capat;
int nr[50005];
int main()
{
f>>n>>m;
capat=m;
for(i=1;i<=n;i++)
{
f>>nr[i];
nr[i]+=nr[i-1];
if(nr[i]>maxim && i>=m)
{
capat=i;
maxim=nr[i];
}
}
/* for(i=1;i<=n;i++)
{
g<<nr[i]<<" ";
} */
minim=nr[m];
inceput=1;
for(i=1;i<=capat-m+1;i++)
{
if(nr[maxim]-nr[i-1]>minim)
{
minim=nr[maxim]-nr[i-1];
inceput=i;
}
}
g<<inceput<<" "<<capat<<" "<<nr[capat]-nr[inceput-1];
return 0;
}