Cod sursa(job #775638)
| Utilizator | Data | 8 august 2012 17:01:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000000];
int main()
{
int n, i, sc=0, smax=-1000000000, st, dr, p=1;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=1;i<=n;i++)
{
if(sc<0){
sc=0;
p=i;
}
sc+=v[i];
if(sc>smax)
{
smax = sc;
st = p;
dr = i;
}
}
out<<smax<<" "<<st<<" "<<dr;
return 0;
}
