Pagini recente » Cod sursa (job #2842262) | Cod sursa (job #1086237) | Cod sursa (job #2923252) | Cod sursa (job #1230021) | Cod sursa (job #1054209)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long long n, k, a[500000], b[500000], maxim=0, c,x ,y;
int main()
{
f>>n>>k;
for( int i = 1; i <= n; i++)
{
f>>a[i];
}
b[1]=a[1];
for( int i = 2; i <= n; i++)
b[i] = b[i-1] + a[i];
for(int i=1; i<=n-k;i++)
for(int j=i+k; j<=n;j++)
{
c=b[j]-b[i-1];
if(c>=maxim)
{
maxim=c;
x=i;
y=j;
}
}
g<<x<<' '<<y<<' '<<maxim;
//g<<maxim<<endl;
/*for( int j = 1; j <= n; j++)
{
g<<b[j]<<' ';
}*/
}