Cod sursa(job #907081)
Utilizator | Radu Cristina Crisulinaa | Data | 7 martie 2013 16:42:04 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
#include<limits.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int s[6000001],n;
int main (){
int i,smax=INT_MIN,sc=0,smin=0,start,end,x,pmin=0;
in>>n;
for(i=1;i<=n;i++){
in>>x;s[i]=s[i-1]+x;}
for(i=1;i<=n;i++){
sc=s[i]-smin;
if(sc>smax){smax=sc;start=pmin+1;end=i;}
if(s[i]<smin){smin=s[i];pmin=i;}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}