Cod sursa(job #1127737)
| Utilizator | Data | 27 februarie 2014 13:38:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int main()
{
int n, sum, x[1000], max, i, car, 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;
}