Cod sursa(job #1847441)

Utilizator GrandmasterSoucup Bogdan Grandmaster Data 14 ianuarie 2017 17:07:42
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int x[100054];
FILE *f, *g;
int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> x[i];
    int id, sum = 0, ma = -long(2e9), ii, ev;
    for(int i = 0; i < n; i++)
    {
        if(sum < 0)
        {
            sum = x[i];
            ii = i;
        }
        else
            sum += x[i];
        if(ma < sum)
        {
            ma = sum;
            id = ii;
            ev = i;
        }
    }
    cout << ma << " " id + 1 << " " << ev + 1;
    return 0;
}