Pagini recente » Cod sursa (job #2227918) | Cod sursa (job #1047456) | Monitorul de evaluare | Cod sursa (job #3329767) | Cod sursa (job #3309133)
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
const int NMAX = 6e6;
int v[NMAX + 1];
int main(){
int n;
fin >> n;
for (int i = 1; i <= n; i++){
fin >> v[i];
}
int st, dr;
long long sum = 0, summin = 0, j = 1, rez = -1;
for (int i = 1; i <= n; i++){
sum = sum + v[i];
if (sum - summin > rez){
rez = sum - summin;
st = j;
dr = i;
}
if (sum - summin == rez && j < st){
st = j;
dr = i;
}
if (sum < summin){
summin = sum;
j = i + 1;
}
}
fout << rez << " " << st << " " << dr;
return 0;
}