Cod sursa(job #2134389)
Utilizator | Data | 17 februarie 2018 21:41:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,pmin,a,in,sf;
long long ma,s,mi;
int main() {
f>>n;
pmin=0;
ma=-10000000000000000;
mi=0;
for(int i=1; i<=n; i++) {
f>>a;
s+=a;
if(s-mi>ma) {
ma=s-mi;
in=pmin+1;
sf=i;
}
if(s<mi) {
pmin=i;
mi=s;
}
}
g<<ma<<" "<<in<<" "<<sf;
return 0;
}