Pagini recente » Cod sursa (job #2279357) | Cod sursa (job #3292830) | Cod sursa (job #1446072) | Cod sursa (job #972851) | Cod sursa (job #1127839)
#include<fstream>
using namespace std;
const int Max = 6000006;
int x[Max];
int main()
{
int n, sum, max, i, car=0, u = 0, sul;
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
for (i = 0; i < n; i++)
f >> x[i];
sum = x[0];
max = x[0];
for (i = 1; i < n; i++)
{
if (sum + x[i]>max) {
max = sum + x[i]; u = i;
}
if (sum + x[i] >= x[i]) {
sum = x[i] + sum;
}
else {
car = i;
sum = x[i];
}
}
g << max << " " << car + 1 << " " << u + 1 << endl;
}