Cod sursa(job #1946823)
| Utilizator | Data | 30 martie 2017 15:17:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n, nr, sum, i, max1, cs, l, poz, ccs, ccd;
fin>>n;
sum=0;
cs=1;
max1=0;
for(i=1;i<=n;i++) {
fin>>nr;
sum=sum+nr;
if(sum<0) {
sum=0;
cs=i;
}
if(sum>max1) {
max1=sum;
ccs=cs;
ccd=i;
}
}
ccs++;
fout<<max1<<" "<<ccs<<" "<<ccd;
return 0;
}
