Pagini recente » Cod sursa (job #2433192) | Cod sursa (job #1091107) | Cod sursa (job #804831) | Cod sursa (job #2384845) | Cod sursa (job #775944)
Cod sursa(job #775944)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int v[50005];
int sum[50005];
int main()
{
int p1,p2,p1f,p2f,sc,sm,k,n,i;
f>>n>>k;
sum[0]=0;
for(i=1;i<=n;i++)
{
f>>v[i];
sum[i]=sum[i-1]+v[i];
}
sc = sm = sum[k];
p1 = p1f = 1;
p2f = k;
for(i=k+1;i<=n;i++)
{
if(sum[i] - sum[i-k] > sc + v[i])
{
sc = sum[i] - sum[i-k];
p1 = i - k + 1;
}
else sc += v[i];
if(sc>sm){
sm=sc;
p1f=p1;
p2f=i;
}
}
g<<p1f<<" "<<p2f<<" "<<sm;
return 0;
}