Cod sursa(job #2162929)
Utilizator | Data | 12 martie 2018 15:51:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int smax,x,n,i,st,dr,best[6000001];
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x;
best[i]=x;
if (best[i]<best[i-1]+x) best[i]=best[i-1]+x;
else st=i;
if (best[i]>smax) {smax=best[i];dr=i;}
}
fout<<smax<<" "<<st<<" "<<dr<<'\n';
return 0;
}