Pagini recente » Cod sursa (job #286127) | Cod sursa (job #1443012) | Cod sursa (job #2092315) | Cod sursa (job #3145105) | Cod sursa (job #3146108)
#include <fstream>
using namespace std;
const int DIM = 6000010;
int n;
int v[DIM];
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
int bestSum = 0, start = 0, end = 0;
int sum = 0, index = 0;
for (int i = 1; i <= n; i++) {
if (sum < 0)
sum = v[i], index = i;
else
sum += v[i];
if (sum > bestSum) {
bestSum = sum;
start = index, end = i;
}
}
fout << bestSum << ' ' << start << ' ' << end;
fin.close();
fout.close();
return 0;
}