Pagini recente » Cod sursa (job #2118777) | Cod sursa (job #3279031) | Cod sursa (job #324605) | Cod sursa (job #2461976) | Cod sursa (job #806182)
Cod sursa(job #806182)
#include <fstream>
using namespace std;
ifstream f;
ofstream g;
int k,n;
int a[50000];
long m=-1000000,p,q,s;
void cit()
{
f.open("secv2.in");
f>>n>>k;
for (int i=1;i<=n;i++) f>>a[i];
f.close();
}
long suma(int p,int q)
{
long s=0;
for (int i=p;i<=q;i++) s+=a[i];
return s;
}
void din()
{
for (int i=k;i<=n;i++)
for (int j=k;j<=i;j++)
{
s=suma(i-j+1,i);
if (s>m)
{
m=s;
p=i-j+1;
q=i;
}
}
}
int main()
{
g.open("secv2.out");
cit();
din();
g<<p<<" "<<q<<" "<<m;
g.close();
return 0;
}