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