Pagini recente » Cod sursa (job #117304) | Cod sursa (job #955513) | Cod sursa (job #2397991) | Cod sursa (job #675324) | Cod sursa (job #2497713)
#include <iostream>
#include <fstream>
using namespace std;
int v[6000001];
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, i, min1, max1, a, b, p;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
v[i] = v[i] + v[i-1];
}
max1=v[1];
min1=v[1];
p=1;
for(i=2; i<n; i++)
{
if(v[i] - min1 > max1)
{
max1=v[i] - min1;
a=p+1;
b=i;
}
if(v[i] < min1)
{
min1= v[i];
p=i;
}
}
if(v[n] - min1 > max1)
{
max1=v[i] - min1;
a=p+1;
b=i;
}
fout<<v[b] - v[a-1]<<' '<<a<<' '<<b;
}