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