Pagini recente » Cod sursa (job #1972800) | Cod sursa (job #1098038) | Cod sursa (job #1101342) | Cod sursa (job #1251432) | Cod sursa (job #1127796)
#include<fstream>
using namespace std;
const int Max = 100000001;
int x[Max];
int main()
{
int n, sum, max, i, car=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];
car = i;
}
if (sum + x[i]>sum)
sum = x[i];
}
g << max << " " << car + 1 << " ";
sul = x[car];
while (sul != max)
{
sul += x[car];
car++;
}
g << car+1;
}