Pagini recente » Cod sursa (job #2783979) | Cod sursa (job #1958630) | Cod sursa (job #3121437) | Cod sursa (job #1910326) | Cod sursa (job #1096938)
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[50001],sum[50001],best[50001];
int n,k,i,j,bestsum,suma;
//int min1;
int st,dr;
int main()
{
f>>n>>k;
sum[0]=0;
for(i=1;i<=n;i++)
{
f>>a[i];
sum[i]=a[i]+sum[i-1];
}
//min1=sum[0];
bestsum=-25001;
for(i=1;i<=n-k+1;i++)
{
for(j=i+k-1;j<=n;j++)
{
suma=sum[j]-sum[i-1];
if(suma>bestsum)
{
bestsum=suma;
st=i;
dr=j;
}
/*best[i]=sum[i]-min1;
if(min1>sum[i])
min1=sum[i];
if(bestsum<best[i])
bestsum=best[i];*/
}
}
g<<st<<" "<<dr<<" "<<bestsum;
return 0;
}