Cod sursa(job #1216710)
Utilizator | Diana Pislaru dianaa21 | Data | 5 august 2014 15:07:29 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#define INF 0x3f3f3f
using namespace std;
ifstream is ("ssm.in");
ofstream os ("ssm.out");
int n, a[6000001], s, maxim = -INF, b, e, b2;
int main()
{
is >> n;
for(int i = 1; i <= n; ++i)
is >> a[i];
for(int i = 1; i <= n; ++i)
{
if(s < 0)
b2 = i, s = a[i];
else
s += a[i];
if(s > maxim)
{
maxim = s;
b = b2;
e = i;
}
}
os << maxim << ' ' << b << ' ' << e;
is.close();
os.close();
return 0;
}