Cod sursa(job #2513448)
| Utilizator | Data | 23 decembrie 2019 10:14:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int x, in = 1, maxi = -900000000, inc = 1, sf = 1, n, s = 0;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> x;
if(s < 0)
{
s = 0;
in = i;
}
s += x;
if(s > maxi)
{
maxi = s;
inc = in;
sf = i;
}
}
cout << maxi << " " << inc << " " << sf;
return 0;
}
