Cod sursa(job #1858393)
| Utilizator | Data | 27 ianuarie 2017 15:12:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
/**
*/
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int maxim,suma=0,pi=1,pf=1,pis=1,n,x;
fin>>n;
fin>>x;
suma+=x;
maxim=x;
for(int i=2;i<n;i++){
fin>>x;
if(x>suma+x){
pis=i;
suma=x;
}
else{
suma+=x;
}
if(suma>maxim){
maxim=suma;
pi=pis;
pf=i;
}
}
fout<<maxim<<" "<<pi<<" "<<pf ;
return 0;
}
