Cod sursa(job #2109343)
Utilizator | Data | 19 ianuarie 2018 16:48:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
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 n, x, s1, s, maxim = -1, p, u;
int main()
{
fin>>n;
for(int i = 1; i <= n; i++){
fin>>x;
if(i == 1){
s = x;
p = i;
}
else{
s1 = x + s;
if(s1 > x){
s = s1;
}
else{
s = x;
p = i;
}
}
if(maxim < s){
maxim = s;
u = i;
}
}
fout<<maxim<<" "<<p<<" "<<u;
return 0;
}