Cod sursa(job #661983)

Utilizator galbenugalbenu dorin galbenu Data 15 ianuarie 2012 17:34:51
Problema Secventa 2 Scor 70
Compilator cpp Status done
Runda winner16 Marime 0.75 kb
#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;
}