Cod sursa(job #1415085)
Utilizator | Data | 3 aprilie 2015 18:53:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int n, v[100], s[100], Max, i, p, pm, um;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
if (v[i] > s[i-1] + v[i]) {
s[i] = v[i];
p = i;
} else {
s[i] = s[i-1] + v[i];
}
if(s[i] > Max){
Max = s[i];
pm = p;
um = i;
}
}
fout<<Max<<" "<<pm<<" "<<um;
}