Cod sursa(job #2569980)
Utilizator | Data | 4 martie 2020 14:32:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
typedef long long ll;
ifstream cin ("ssm.in");
ofstream cout("smm.out");
const int N = 60000001;
int Sum_Max;
int s, contor;
int n;
int x;
int start , stop;
ll best = -int(2e9);
int inc = 1, sf = 1;
int main() {
cin >> n;
for( int i = 1 ;i <=n;i ++)
{
cin >> x;
if(s < 0)
{
s= x;
inc = i;
} else
s +=x;
if(best < s)
{
best = s;
start = inc;
stop = i;
}
}
cout << best <<" "<< start <<" "<< stop;
return 0;
}