Cod sursa(job #1861431)
| Utilizator | Data | 28 ianuarie 2017 21:23:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{int n,nr,suma=0,maxim,capat1=1,capat2=1,pis=1;
fin>>n;
fin>>nr;
suma+=nr;
maxim=suma;
for(int i=2;i<=n;i++){
fin>>nr;
if(nr>suma+nr){
suma=nr;
pis=i;
}else{
suma=suma+nr;
}
if(suma>maxim){
maxim=suma;
capat1=pis;
capat2=i;
}
}
fout<<maxim<<" "<<capat1<<" "<<capat2;
return 0;
}
