Pagini recente » Cod sursa (job #1570964) | Cod sursa (job #2371306) | Cod sursa (job #423971) | Cod sursa (job #1544795) | Cod sursa (job #2910118)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6 * 1e6, oo = 1LL * (1 << 31) - 1;
int n, sum, start, finish;
int v[NMax + 5];
void Read(){
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
}
void Solve(){
sum = -oo;
int left = 1, s = 0;
for (int i = 1; i <= n; i++){
s += v[i];
if (s > sum){
sum = s;
start = left;
finish = i;
}
if (s < 0){
s = 0;
left = i + 1;
}
}
}
void Print(){
fout << sum << ' ' << start << ' ' << finish << '\n';
}
int main(){
Read();
Solve();
Print();
return 0;
}