Cod sursa(job #2290523)
| Utilizator | Data | 26 noiembrie 2018 17:08:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
const int DIM = 60000001;
int nr[DIM];
int n;
int main()
{
cin >> n;
int maxi = -1, x = 1, y = 1, sc = 0, xm = 1, ym = 1;
for(int i = 1; i <= n; ++i)
{
int x;
cin >> x;
if(sc + x > x)
{
sc += x;
y = i;
}
else
{
sc = x;
x = i;
y = i;
}
if(sc > maxi)
{
maxi = sc;
xm = x;
ym = y;
}
}
cout << maxi << ' ' << xm << ' ' << ym;
return 0;
}
