Pagini recente » Cod sursa (job #2018875) | Cod sursa (job #175825) | Cod sursa (job #1948664) | Cod sursa (job #333898) | Cod sursa (job #307570)
Cod sursa(job #307570)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
main()
{
int v[2][50001],n,k,i,max,p,l,t,j;
f>>n>>k;
t=0;
f>>v[0][1];
if (k==1)
{
max=v[0][1];
p=1; l=1;
}
else
{
max=-25000*50000;
}
t=1;
for (i=2;i<=n;i++)
{
f>>v[t][1];
for (j=2;j<=i;j++)
{
v[t][j]=v[1-t][j-1]+v[t][1];
if (j>=k && v[t][j]>max)
{
max=v[t][j];
p=i; l=j;
}
}
t=1-t;
}
g<<p-l+1<<" "<<p<<" "<<max<<"\n";
g.close();
}