Cod sursa(job #675123)
Utilizator | Coconetu Stefan koko | Data | 7 februarie 2012 10:57:41 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int main ()
{
int n,i,st=0,dr=0,smax=-1000000000,sc=0,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;
}