Cod sursa(job #1149215)
Utilizator | Data | 21 martie 2014 15:39:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<limits.h>
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int s[6000001],n;
int main(){
int i,x,sc,smax=INT_MIN,start,end,smin=0,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<<" "<<endl;
}