Cod sursa(job #1588917)
Utilizator | Data | 3 februarie 2016 18:34:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{int n,v[60000],i,maxx,s,dr,st;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
maxx=0; s=0; dr=1; st=1;
for(i=1;i<=n;i++)
{s=s+v[i];
if(s>maxx)
{
maxx=s;
dr=i;
}
if(s<0)
{
s=0;
st=st+i;
}
}
out<<maxx<<" "<<st<<" "<<dr;
return 0;
}