Pagini recente » Cod sursa (job #459381) | Cod sursa (job #379358) | Cod sursa (job #257823) | Cod sursa (job #2897171) | Cod sursa (job #1974697)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000000], s[6000000];
int main()
{
int n;
f >> n;
for(int i = 0; i < n; i++){
f >> a[i];
}
int sum = a[0], maxim = a[0], poz1 = 0, poz2;
for(int i = 1; i < n; i++){
if(a[i] > a[i] + sum){
sum = a[i];
poz1 = i+1;
}
else{
sum = a[i] + sum;
}
if(sum > maxim){
maxim = sum;
poz2 = i+1;
}
}
g << maxim << " " << poz1 << " " << poz2;
return 0;
}