Pagini recente » Cod sursa (job #1160949) | Cod sursa (job #2998566) | Cod sursa (job #428866) | Rating Andrada Cojocaru (andrada2504) | Cod sursa (job #1071421)
#include <fstream>
using namespace std;
int N,K,v[50005],s[50005];
inline void Read()
{
ifstream fin("secv2.in");
fin>>N>>K;
for(int i=1;i<=N;++i)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
fin.close();
}
inline void Solve()
{
int st=1,dr=K,maxim=s[K],val=s[K],a,i;
for(i=K+1;i<=N;++i)
{
val+=v[i];
if(s[i]-s[i-K-1]>val)
{
val=s[i]-s[i-K-1];
a=i-K;
}
if(val>maxim)
{
maxim=val;
st=a; dr=i;
}
}
ofstream fout("secv2.out");
fout<<st<<" "<<dr<<" "<<maxim<<"\n";
fout.close();
}
int main()
{
Read();
Solve();
return 0;
}