Cod sursa(job #2743092)
Utilizator | Vraja Luca LORDEN | Data | 22 aprilie 2021 15:53:29 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in") ;
ofstream cout ("ssm.out") ;
int n ;
int main()
{
long long x, sum = 0, max1 = -1, st, dr, ind1, ind2 ;
cin >> n ;
cin >> x ;
sum = x ;
max1 = x ;
ind1 = 1, ind2 = 1 ;
for (int i = 2 ; i <= n ; i ++)
{
cin >> x ;
if (sum > 0)
sum += x, dr = i ;
else
sum = x, st = i ;
if (sum > max1)
max1 = sum, ind1 = st, ind2 = i ;
}
cout << max1 << ' ' << ind1 << ' ' << ind2 ;
return 0 ;
}