Cod sursa(job #1871114)
| Utilizator | Data | 7 februarie 2017 10:27:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int N, sum, bSum = INT_MIN, poz, I, J, A[6000003];
int main()
{
f >> N;
for(int i = 1; i <= N; i++) f >> A[i];
for(int i = 1; i <= N; i++) {
if(sum < 0) sum = A[i], poz = i;
else sum += A[i];
if(bSum < sum) bSum = sum, I = poz, J = i;
}
g << bSum << " " << I << " " << J << "\n";
return 0;
}
