Cod sursa(job #1901036)

Utilizator GeanaVladGeana Vlad GeanaVlad Data 3 martie 2017 18:34:52
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.81 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,pmax,mx=-100000,v[50000],s[50000],i;
int Deque[50000],Front,Back;
int main()
{
    f>>n>>k;
    for(i=1; i<=n; i++)
    {
        f>>v[i];
        s[i]=s[i-1]+v[i];
    }
    Front=1;
    Back=0;
    for(i=1; i<=n; i++)
    {
        if(Deque[Front]>0)
            while(s[Deque[Back]]-s[Deque[Front]-1]<0 && Back-Front+1>=k)
                Front++;
        if(Deque[Back]-Deque[Front]+1>=k)
            if(s[Deque[Back]]-s[Deque[Front]-1] > mx)
            {
                mx=s[Deque[Back]]-s[Deque[Front]-1];
                pmax=Deque[Back];
            }
        Deque[++Back]=i;
    }
    g<<mx<<' ';
    for(i=pmax;mx && i;i--)
        mx-=v[i];
    g<<i+1<<' '<<pmax;
}