Pagini recente » Cod sursa (job #1094957) | Cod sursa (job #832108) | Cod sursa (job #2611492) | Cod sursa (job #1688966) | Cod sursa (job #1070777)
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, v[6000001], i, sum[6000001], Max=-1, inc, sf, nre;
int main()
{
f>>n;
for (i=1; i<=n; i++)
f>>v[i];
for (i=1; i<=n; i++)
{
sum[i]=max(v[i], sum[i-1]+v[i]);
nre++;
if (sum[i]==v[i])
nre=1;
if (Max < sum[i])
{
Max = sum[i];
inc=i-nre+1;
sf=i;
}
if (Max == sum[i])
{
if (inc>i-nre+1)
{
inc = i - nre + 1;
if (sf>i)
sf=i;
}
if (inc==i-nre+1)
if (sf>i)
sf=i;
}
}
g<<Max<<" "<<inc<<" "<<sf;
return 0;
}