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