Cod sursa(job #1589040)
Utilizator | Data | 3 februarie 2016 19:16:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
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 s, n, i, v[1000], maxx, dr=1, st=1, p=1;
in>>n;
for(i=1;i<=n; i++)
in>>v[i];
i=1;
maxx=v[1];
s=v[1];
for(i=2;i<n; i++)
{
s=s+v[i];
if(s>maxx)
{
maxx=s;
st=p;
dr=i;
}
if(s<0)
{
s=0;
p=i+1;
}
}
out<<maxx<<" "<<st<<" "<<dr;
return 0;
}