Pagini recente » Cod sursa (job #2008607) | Cod sursa (job #1573359) | Cod sursa (job #2861421) | Cod sursa (job #1714740) | Cod sursa (job #271666)
Cod sursa(job #271666)
#include<fstream.h>
int main()
{
long n,k,i,j,pi=0,pf=0,max=-2147483647,a[50001],suma[50001];
ifstream fin("secv2.in");
fin>>n>>k;
suma[0]=0;
for (i=1; i<=n; i++)
{
fin>>a[i];
suma[i]=suma[i-1]+a[i];
}
ofstream fout("secv2.out");
if (k==n)
fout<<"1 "<<n<<" "<<suma[n]; else
{
for (i=1; i<=n-k+1; i++)
for (j=i+k-1; j<=n; j++)
if (suma[j]-suma[i-1]>max)
{
pi=i;
pf=j;
max=suma[j]-suma[i-1];
}
fout<<pi<<" "<<pf<<" "<<max;
}
fin.close();
fout.close();
return 0;
}