Mai intai trebuie sa te autentifici.
Cod sursa(job #1939076)
Utilizator | Data | 25 martie 2017 13:49:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
#include<climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000001],a[6000001];
int main()
{
int Max=-INT_MIN,x=0,Min=0,dr,st,i,j,N;
fin>>N;
for(i=1;i<=N;i++)
fin>>a[i];
for(i=1; i<=N; i++)
{
s[i]=s[i-1]+a[i];
if(s[i-1]<Min)
{
Min=s[i-1];
x=i-1;
}
if(s[i]-Min>Max)
{
Max=s[i]-Min;
st=x;
dr=i;
}
}
fout<<Max<<" "<<st+1<<" "<<dr;
return 0;
}