Cod sursa(job #1282648)

Utilizator kappykkDragos kappykk Data 4 decembrie 2014 16:46:00
Problema Subsecventa de suma maxima Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <fstream>
#define VM 6000001

using namespace std;

ifstream f("ssm.in");
ofstream g("ssm.out");

int x[VM];

int main()
{
    int max = -VM;
    int n;
    f>>n;
    for(int i = 1 ; i <= n ; ++i){
        f>>x[i];
    }
    int s, ii, ij;
    for(int i = 1 ; i < n ; ++i){
        s = x[i];
        for(int j = i + 1 ; j <= n ; ++j){
            s += x[j];
            if(s > max){
                max = s;
                ii = i;
                ij = j;
            }
        }
    }
    g<<max<<" "<<ii<<" "<<ij;
    return 0;
}