Cod sursa(job #2227647)
Utilizator | Data | 1 august 2018 12:15:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,v[6000010],d[6000010],i,p1,p2;
int main() {
fin>>n; s=0;
for (i=1;i<=n;i++) {
fin>>v[i];
if (d[i-1]+v[i]>v[i]) {
d[i]=d[i-1]+v[i];
p2++;
}
else {
p1=i; p2=i;
d[i]=v[i];
}
s=max(s,d[i]);
}
fout<<s<<" "<<p1<<" "<<p2-1;
return 0;
}