Pagini recente » Cod sursa (job #1238798) | Cod sursa (job #1111114) | Cod sursa (job #1582620) | Cod sursa (job #708412) | Cod sursa (job #2964282)
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int NrMax = 6000005;
const int NR = 2000000005;
int n, x, s, Min, Max, p1, p2, mini[NrMax], maxi[NrMax];
int main()
{
f >> n;
mini[0] = NR;
for(int i = 1; i <= n; i ++)
{
f >> x;
s += x;
mini[i] = min(mini[i - 1], s);
maxi[i] = max(maxi[i - 1], s);
}
Min = mini[1]; p1 = 1;
for(int i = 2; i <= n; i ++)
if(Min > mini[i])
{
Min = mini[i];
p1 = i + 1;
}
for(int i = p1; i <= n; i ++)
if(Max < maxi[i])
{
Max = maxi[i];
p2 = i;
}
g << Max - Min << " " << p1 << " " << p2;
return 0;
}