Cod sursa(job #1863014)

Utilizator Cristi_ChiraChira Cristian Cristi_Chira Data 30 ianuarie 2017 16:24:36
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.68 kb
#include <fstream>
#include <climits>

#define DM 50005
#define x first
#define y second
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int maxS=LONG_LONG_MIN, mini=INT_MIN, ssp[DM], maxI, maxJ, I;
int main()
{
    int n, k, m, t, centr, pet;
    f>>n>>k;
    for(int i=1; i<=n; i++)
    {
        f>>m;
        ssp[i]=ssp[i-1]+m;
        if(i>=k)
        {
            if(ssp[i-k]<mini)
                mini=ssp[i-k], I=i-k;
            if(ssp[i]-mini>maxS)
            {
                maxS=ssp[i]-mini;
                maxI=I+1;
                maxJ=i;
            }
        }
    }
    g<<maxI<<" "<<maxJ<<" "<<maxS;
    return 0;
}