Cod sursa(job #1412146)
| Utilizator | Data | 1 aprilie 2015 09:55:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x,s,maxim,ii,i,n,p,u;
int main(){
fin>>n;
maxim=-2000000000;
s=0;
ii=1;
for(i=1;i<=n;i++){
fin>>x;
s+=x;
if(s<0){
s=x;
ii=i;
}
if(maxim<s){
maxim=s;
p=ii;
u=i;
}else{
if(maxim==s){
if(i-ii<u-p){
p=ii;
u=i;
}
}
}
}
fout<<maxim<<" "<<p<<" "<<u;
return 0;
}
