Pagini recente » Cod sursa (job #1476739) | Cod sursa (job #135948) | Cod sursa (job #699568) | Cod sursa (job #2393857) | Cod sursa (job #2431726)
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[50001];
long long s[50001];
int main()
{
int n,k,i,j;
in >> n >> k;
for(i=1;i<=n;i++)
{
in >> v[i];
s[i]=s[i-1]+v[i];
}
int suma,maxi=0,ls=0,ld=0;
for(j=k-1;j<n;j++)
{
for(i=1;i<=n-j;i++)
{
suma=s[i+j]-s[i-1];
if(suma>maxi)
{
ls=i;
ld=j+i;
maxi=suma;
}
}
}
out << ls << " " << ld << " " << maxi << '\n';
return 0;
}