Pagini recente » Cod sursa (job #2061402) | Cod sursa (job #604186) | Cod sursa (job #2699704) | Borderou de evaluare (job #201437) | Cod sursa (job #661984)
Cod sursa(job #661984)
#include<fstream>
#include<iostream>
#include<cstring>
#define lmax 50005
#define INFINIT 0x3f3f3f
using namespace std;
ifstream f("secv2.in",fstream::in);
ofstream g("secv2.out",fstream::out);
long a[lmax],maxim=-INFINIT;
short int n,k,pinc,psf;
void read()
{
short int i;
f>>n>>k;
f>>a[1];
for(i=2; i<=n; i++)
f>>a[i],a[i]+=a[i-1];
}
void solve()
{
short int i,j;
for(i=k; i<=n; i++)
for(j=0; j<=i-k; j++)
{
if(a[i]-a[j]>maxim)
{
maxim=a[i]-a[j];
pinc=j+1;
psf=i;
}
}
}
int main()
{
read();
solve();
g<<pinc<<" "<<psf<<" "<<maxim;
f.close();
g.close();
return 0;
}