Cod sursa(job #907996)
| Utilizator | Data | 8 martie 2013 16:55:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <climits>
#define M 6000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[M], n;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>s[i];
int bestsum = INT_MIN, sum=0, st, dr, ii;
for(int i=1; i<=n; i++){
if(sum < 0) {sum = s[i]; ii = i;}
else sum += s[i];
if(bestsum < sum) { bestsum = sum; st = ii; dr = i;}
}
fout<<bestsum<<" "<<st<<" "<<dr;
return 0;
}
