Cod sursa(job #2365829)
| Utilizator | Data | 4 martie 2019 16:44:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v, n, i, i1, i2, i1p;
long long sum, ssm;
int main(){
fin >> n;
for (i=1; i<=n; i++){
fin >> v;
if (sum < 0){
sum = v;
i1p = i;
}
else{
sum += v;
}
if (sum > ssm){
ssm = sum;
i1 = i1p;
i2 = i;
}
}
fout << ssm << " " << i1 << " " << i2;
return 0;
}
//recapitulare
