Pagini recente » Arbori Indexati Binar | Cod sursa (job #2279375) | Cod sursa (job #2484449) | Cod sursa (job #1819896) | Cod sursa (job #2260892)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a[6000002];
int main()
{
int s, smax, p, st, dr, i;
fin >> n;
s = smax = 0;
p = st = dr = 1;
fin >> a[1];
if(a[i] < 0)
{
s = 0;
p = 2;
}
for(i = 2; i <= n; i++)
{
fin >> a[i];
s += a[i];
if(s > smax)
{
smax = s;
st = p;
dr = i;
}
if(s < 0)
{
s = 0;
p = i + 1;
}
}
fout << smax << " " << st << " " << dr << "\n";
fin.close();
fout.close();
return 0;
}