Cod sursa(job #1731990)
Utilizator | Moise Andrei Moise_Andrei | Data | 20 iulie 2016 15:53:35 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
long long mn=0, best=-1000000000;
int n, s, d, a = 1;
in >> n;
long long sum = 0;
for( int i = 1; i <= n; i ++ )
{
int a;
in >> a;
sum += a;
if( best <= sum - mn )
{
d = i;
s = a;
best = sum - mn;
}
if( mn > sum )
mn = sum,a = i + 1;
}
out << best << " " << s << " " << d;
return 0;
}