Pagini recente » Cod sursa (job #2283571) | Cod sursa (job #1815500) | Cod sursa (job #1136768) | Cod sursa (job #409386) | Cod sursa (job #2478040)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,x,M,s, st, dr, p;
/// st si dr retin capetele secventei maxime
/// p = poz de inceput a sumei
fin >> n;
fin >> x;
M = s = x;
st = dr = p = 1;
if (s < 0)
{
s = 0;
p = 2;
}
for (i=2; i<=n; i++)
{
fin >> x;
s+=x;
if (M < s) { M = s; dr = i; st = p;}
if (s < 0) { s = 0; p = i + 1;}
}
fout << M << " " << st << " " << dr;
return 0;
}