Cod sursa(job #826999)
| Utilizator |  Neculaescu Theodor sleepaholic |
Data | 1 decembrie 2012 15:11:02 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int main(){
long long s,n,i,nr,max,l1,l2,lr;
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
s=0;
max=-1000000000;
for(i=1;i<=n;i++){
in>>nr;
s+=nr;
if(nr>max){
max=nr;
lr=i;
l2=i;
}
if(s>max){
max=s;
lr=l1;
l2=i;
}
if(s>0){
s=0;
l1=i+1;
}
}
out<<max<<" "<<lr<<" "<<l2;
return 0;
}
