Cod sursa(job #1907825)
Utilizator | Data | 6 martie 2017 21:08:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int st,dr,mij,t,x,i,n,m,a[6000001],s,suma[6000001],x1,x2;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
s=a[1];
for(i=1;i<=n;i++){
suma[i]=a[i];
if(suma[i]<suma[i-1]+a[i])
suma[i]=suma[i-1]+a[i];
else x=i;
if(s<suma[i]){
s=suma[i];
x1=x;
x2=i;
}
}
g<<s<<" "<<x1<<" "<<x2;
}