Cod sursa(job #1153145)
Utilizator | Data | 25 martie 2014 11:48:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,i,J=1,I=1,I1=1,x,bestsum=LONG_MIN,sum=0;
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,I1=I;
}
g<<bestsum<<" "<<I1<<" "<<J;
}