Cod sursa(job #886696)
Utilizator | Data | 23 februarie 2013 10:04:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int n,a,best=-2000000000,i,s=-200000000,in,r,l;
int main(){
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++){
f>>a;
if(best>=0)
best+=a;
else{
best=a;
in=i;}
if(best>s){
l=in;r=i;
s=best;}
}
g<<s<<' '<<l<<' '<<r;
return 0;}