Pagini recente » Cod sursa (job #1841377) | Cod sursa (job #2909472) | Cod sursa (job #1538459) | Cod sursa (job #2111535) | Cod sursa (job #2668736)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const long long INF = 1<<30 - 1;
const int sz = 50001;
long long S[sz],current_sum=INF,max_sum=-INF;
int main()
{
int n,k;
fin>>n>>k;
int st,dr,pos;
for(int i=1; i<=n; i++)
{
int x;
fin>>x;
S[i]=S[i-1]+x;
}
for(int i=k; i<=n; i++)
{
if(S[i-k]<current_sum)
{
current_sum=S[i-k];
pos=i-k+1;
}
if(S[i]-current_sum>max_sum)
{
max_sum=S[i]-current_sum;
st=pos;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<max_sum<<'\n';
fout.flush();
}