Pagini recente » Cod sursa (job #2444403) | Cod sursa (job #1880490) | Cod sursa (job #2472253) | Cod sursa (job #116919) | Cod sursa (job #1866753)
#include <fstream>
using namespace std;
ifstream F("ssm.in");
ofstream G("ssm.out");
int n, sm, Smax, dr, st, v[6000005], p1, p2;
int main()
{
F >> n;
for(int i = 1; i <= n; ++ i)
F >> v[i];
Smax = -1 << 31;
sm = v[1]; dr = st = 1;
if(Smax < sm)
Smax = sm, p1 = p2 = 1;
while(dr < n)
{
if(sm >= 0)
sm += v[++dr];
else
st = ++ dr, sm = v[st];
if(Smax < sm)
Smax = sm, p1 = st, p2 = dr;
}
G << Smax << " " << p1 << " " << p2;
return 0;
}