Cod sursa(job #2140659)
Utilizator | Data | 23 februarie 2018 19:11:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, smin=2147483647, s[6000005], st, xmax, dr, i;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
if(s[i]-smin>xmax)
{
xmax=s[i]-smin;
dr=i;
}
if(s[i]<smin)
{
smin=s[i];
st=i+1;
}
}
fout<<xmax<<' '<<st<<' '<<dr;
return 0;
}