Cod sursa(job #1153085)
Utilizator | Data | 25 martie 2014 11:18:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long n,i,J,I,x,bestsum=0,sum=LONG_MIN;
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>x;
sum+=x;
if(sum<0){ sum=0,I=i+1; continue;}
if(sum>bestsum) bestsum=sum,J=i;
}
g<<bestsum<<" "<<I<<" "<<J;
}