Pagini recente » Cod sursa (job #1568925) | Cod sursa (job #2959145) | Cod sursa (job #2367918) | Cod sursa (job #744024) | Cod sursa (job #2488414)
#include <fstream>
using namespace std;
ifstream ci ("secv2.in");
ofstream co ("secv2.out");
int v[50002], sum[50002];
int main()
{
int n, k, i, s, max, p1=1, p2, x=1;
ci >> n >> k;
for(i=1; i<=k; i++)
{
ci >> v[i];
sum[i]=sum[i-1]+v[i];
}
s=max=sum[k];
p2=k;
for (i=k+1; i<=n; i++)
{
ci >> v[i];
sum[i]=sum[i-1]+v[i];
if(sum[i]-sum[i-k]>s+v[i])
{
s=sum[i]-sum[i-k];
x=i-k+1;
}
else
{
s+=v[i];
}
if(s>max)
{
max=s, p1=x;
p2=i;
}
}
co << p1 << " " << p2 << " " << max;
return 0;
}