Cod sursa(job #1094323)

Utilizator MoneaVladMonea Vlad MoneaVlad Data 29 ianuarie 2014 11:30:21
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.68 kb
#include <fstream>
#include <iostream>

using namespace std;

ifstream in("secv2.in");
ofstream out("secv2.out");


int main()
{
    int n,k,i,S[100],V[100],Smin,Su,dr,st;
    in >> n >> k;
    for(i = 1; i <=n ; i++)
        in >> V[i];
    S[0] = 0;
    Smin=25000;
    Su=-25000;
    for(i = 1; i <= n; i++)
        S[i] = S[i-1] + V[i];
    for(i = k; i <= n; i++)
    {
        if (Smin > S[i-k]) {
            Smin = S[i-k];
            st = i - k + 1;
        }
        if(S[i]-Smin>Su)
        {
            Su = S[i] - Smin;
            dr = i;

        }
    }
    out << st << " " << dr << " " << Su;
    in.close();
    out.close();
    return 0;
}