Pagini recente » Borderou de evaluare (job #864954) | Cod sursa (job #953390) | Cod sursa (job #342010) | Cod sursa (job #1992879) | Cod sursa (job #404039)
Cod sursa(job #404039)
#include <fstream>
using namespace std;
int v[50001];
int main()
{
int n,i,s=0,a,b,k,sum=0;
ifstream f("secv2.in");
ofstream o("secv2.out");
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>v[i];
v[i]+=v[i-1];
if (i-sum>k && v[i-k+1]<v[sum]) sum=i-k+1;
if (v[i]-v[sum]>s)
{
s=v[i]-v[sum];
a=sum+1;
b=i;
}
}
o<<a<<" "<<b<<" "<<s;
return 0;
}