Cod sursa(job #1854183)
Utilizator | Pricop Razvan Marius RazorBest | Data | 22 ianuarie 2017 14:37:07 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, x, s = 0, S = 1, b = 1, E, B;
S -= (1<<31);
fin>>n;
for(int i = 1; i <= n; ++i)
{
fin>>x;
s += x;
if(s < 0)
{
s = 0;
b = i + 1;
}
else if(s > S)
{
S = s;
B = b;
E = i;
}
}
fout<<S<<' '<<B<<' '<<E;
}