Cod sursa(job #2648432)

Utilizator LifeArgentToth-Gati Laszlo-Levente LifeArgent Data 10 septembrie 2020 19:29:56
Problema Subsecventa de suma maxima Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>

using namespace std;

void ssm(int n,int tomb[],int &sum
         ,int &kezdindex,int &vegindex) {

    sum = tomb[0];
    kezdindex = vegindex = 0;
    int osszeg = 0;

    for(int i=0; i<n; i++) {
        for(int j=i; j<n; j++) {
            osszeg = osszeg + tomb[j];
            if(osszeg > sum) {
                sum = osszeg;
                kezdindex = i;
                vegindex = j;
            }
        }
        osszeg = 0;
    }
}

int main()
{
    int n, sum, kezdindex, vegindex;
    ifstream be("ssm.in");
    ofstream ki("ssm.out");
    be >> n;
    int* tomb = new int[n];
    for(int i=0; i<n; i++) {
        be >> tomb[i];
    }
    ssm(n,tomb, sum, kezdindex, vegindex);
    ki << sum << " " << kezdindex+1
        << " " << vegindex+1 << endl;
    delete[] tomb;
}