Pagini recente » Cod sursa (job #2367239) | Cod sursa (job #2387494) | Cod sursa (job #2490936) | Cod sursa (job #2668513) | Cod sursa (job #2153957)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
istream & in = fin;
ostream & out = fout;
void solve()
{
int n, a;
int s = 0;
int minip = -1, maxip = -1;
int mini, maxi;
in >> n;
for(int i = 0; i < n; i++){
in >> a;
s += a;
if(minip == -1 || s <= mini){
mini = s;
minip = i;
}
if(maxip == -1 || s >= maxi){
maxi = s;
maxip = i;
}
}
if(minip > maxip){
swap(minip, maxip);
}
minip += 2, maxip += 1;
out << maxi - mini << " " << minip << " " << maxip;
}
int main()
{
solve();
return 0;
}