Cod sursa(job #1937619)

Utilizator andreigasparoviciAndrei Gasparovici andreigasparovici Data 24 martie 2017 08:02:39
Problema Secventa 2 Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.49 kb
#include <deque>
#include <iostream>
#include <cstdio>
#define MAXN 50005
using namespace std;

class InputParser
{
    char *b;
    int bs, bi;
    bool isdigit(char c){ return c>='0' && c<='9';}
    bool issgn(char c){ return c=='-' || c=='+';}
public:
    InputParser(FILE *f)
    {
        fseek(f,0,SEEK_END);
        bs = ftell(f);
        b = new char[bs];
        fseek(f,0,SEEK_SET);
        fread(b,1,bs,f);
        bi = 0;
    }
    InputParser operator>>(int &x)
    {
        x = 0;
        int sgn = 1;
        while(!isdigit(b[bi]) && !issgn(b[bi])) ++bi;

        if(issgn(b[bi]))
        {
            if(b[bi]=='-')
                sgn = -1;
            else sgn=1;
        }

        while(!isdigit(b[bi])) ++bi;

        while(isdigit(b[bi]))
            x = x * 10 + b[bi++] - '0';

        x*=sgn;
        return *this;
    }
};

int k, n, a[MAXN], s[MAXN], m[MAXN], poz[MAXN], inc, sf, smax = -0x3f3f3f3f;
int main()
{
    InputParser in(fopen("secv2.in","r"));

    in>>n>>k;
    for(int i=1;i<=n;i++)
    {
        in>>a[i];
        s[i] = s[i-1] + a[i];
        if(s[i]>m[i-1])
        {
            m[i] = m[i-1];
            poz[i] = poz[i-1];
        }
        else
        {
            m[i] = s[i];
            poz[i] = i;
        }
    }

    for(int i=k;i<=n;i++)
    {
        if(s[i] - m[i-k] > smax)
        {
            smax = s[i] - m[i-k];
            inc = poz[i-k]+1;
            sf = i;
        }
    }

    fprintf(fopen("secv2.out","w"),"%d %d %d",inc-1,sf-1,smax);
    return 0;
}