Pagini recente » Cod sursa (job #1764965) | Cod sursa (job #461533) | Cod sursa (job #549083) | Cod sursa (job #950490) | Cod sursa (job #1071442)
#include <fstream>
using namespace std;
int N,K,v[50005],s[50005];
inline void Read()
{
int i;
ifstream fin("secv2.in");
fin>>N>>K;
for(i=1;i<=N;++i)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
fin.close();
}
inline void Solve()
{
int st,dr,maxim=-2000000000,minim=2000000000,a,i;
for(i=K;i<=N;++i)
{
if(minim>s[i-K])
{
minim=s[i-K];
a=i-K;
}
if(s[i]-minim>maxim)
{
maxim=s[i]-minim;
st=a+1; dr=i;
}
}
ofstream fout("secv2.out");
fout<<st<<" "<<dr<<" "<<maxim<<"\n";
fout.close();
}
int main()
{
Read();
Solve();
return 0;
}