Pagini recente » Cod sursa (job #1707443) | Cod sursa (job #868680) | Cod sursa (job #2772645) | Cod sursa (job #1315502) | Cod sursa (job #2079619)
#include <fstream>
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
int a[50002],i,n,k,in,sf,aux,sums;
void secventa ()
{
in=1;
sf=k;
sums=a[k];
for (int j=k+1;j<=n;j++)
{
if (a[j-k]<a[aux])
aux=j-k;
if (a[j]-a[aux]>sums)
{
sums=a[j]-a[aux];
in=aux+1;
sf=j;
}
}
g<<in<<" "<<sf<<" "<<sums<<'\n';
}
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>a[i];
a[i]+=a[i-1];
}
secventa();
return 0;
}