Cod sursa(job #1387252)
| Utilizator | Data | 13 martie 2015 21:28:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
#define INF 0x3f3f3f
ifstream is("ssm.in");
ofstream os("ssm.out");
int sum;
int s, smax = -INF;
int n;
int beg, en, begf;
int main()
{
is >> n;
for ( int i = 1; i <= n; ++i )
{
is >> s;
if ( sum < 0 )
{
sum = s;
beg = i;
}
else
sum += s;
if ( sum > smax )
{
smax = sum;
begf = beg;
en = i;
}
}
os << smax << ' ' << begf << ' ' << en;
is.close();
os.close();
return 0;
}
