Cod sursa(job #1310756)
Utilizator | Data | 7 ianuarie 2015 10:04:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[6000001];
int main()
{
int n,i,sc=-1,st,dr;
long long smax=-999999999;
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
for(i=1; i<=n; i++)
{
if(sc<0){
sc=0;
st=i;
}
sc+=v[i];
if(sc>smax){
smax=sc;
dr=i;
}
}
out<<smax<<" "<<st<<" "<<dr;
return 0;
}