Pagini recente » Cod sursa (job #2242668) | Cod sursa (job #2949858) | Cod sursa (job #605684) | Cod sursa (job #2947369) | Cod sursa (job #2511939)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int N=50001;
int v[N],n,k,s,smax=-25000*50000,st,dr,a[N],ans1,ans2;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
a[i]=v[i]+a[i-1];
}
st=1;
dr=k;
while(dr<=n)
{
s=a[dr]-a[st-1];
if(s<0)
{
if(s>smax)
{
ans1=st;
ans2=dr;
smax=s;
}
st++;
dr++;
}
else
{
if(s>smax)
{
ans1=st;
ans2=dr;
smax=s;
}
dr++;
}
}
fout<<ans1<<" "<<ans2<<" "<<smax;
return 0;
}