Cod sursa(job #1650210)
| Utilizator | Data | 11 martie 2016 17:13:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
const int nmax = 6e6+5;
const int oo = (1<<30);
int v[nmax];
int main()
{
ios_base::sync_with_stdio(false);
int n, i, st, dr, maxx=-oo, sum=0, poz=1;
fin >> n;
for(i=1; i<=n; i++)
fin >> v[i];
for(i=1; i<=n; i++)
{
if(sum < 0) sum=v[i], poz=i;
else sum+=v[i];
if(sum > maxx) maxx=sum, st=poz, dr=i;
}
fout << maxx << " " << st << " " << dr << "\n";
fin.close();
fout.close();
return 0;
}
