Pagini recente » Cod sursa (job #555974) | Cod sursa (job #2270735) | Cod sursa (job #2134663) | Cod sursa (job #1545504) | Cod sursa (job #1605069)
#include <iostream>
#include <fstream>
using namespace std;
long long n,k,v[50001],s[50001],maxx=-1250000000,maxxi,maxx2=-1250000000,maxx2i;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(int i = 1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
if(s[i]>maxx)
{
maxx = s[i];
maxxi = i;
}
}
maxx2 = s[maxxi]-s[maxxi-k];
for(int i = maxxi-k-1;i>=1;i--)
if(s[maxxi]-s[i] >maxx2 )
{
maxx2 = s[maxxi]-s[i];
maxx2i = i;
}
g<<maxx2i+1<<' '<<maxxi<<' '<<maxx2;
// for(int i = 1;i<=n;i++)
// {
// cout<<p[i]<<' ';
// }
f.close();
g.close();
return 0;
}