Cod sursa(job #783969)
Utilizator | Data | 4 septembrie 2012 16:39:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int INF = 2000000000;
int v[6000000];
int main()
{
int n,i,sc,smax=-INF,j,st,dr;
in >> n;
for(i=0 ; i<n ; i++)
in >> v[i];
sc=0;
for(i=0 ; i<n ; i++)
{
if(sc < 0)
{
sc=0;
j=i;
}
sc=sc+v[i];
if(sc > smax)
{
smax = sc;
st=j;
dr=i;
}
}
out << smax << " " << st + 1 << " " << dr + 1;
return 0;
}