Cod sursa(job #2284975)
Utilizator | Data | 17 noiembrie 2018 20:26:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main() {
int n, s=0, in=1, fin=1, max1=-1e9, t;
cin>>n;
for(int i=1; i<=n; i++) {
int a;
cin>>a;
if(s>=0) {
s+=a;
}
else {
s=a;
t=i;
}
if(s>max1)
max1=s, in=t, fin=i;
}
cout<<max1<<' '<<in<<' '<<fin;
return 0;
}