Cod sursa(job #2407668)
Utilizator | Apostol David DavidAA007 | Data | 17 aprilie 2019 09:48:05 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,x,s[6000005],smax,maxx,minn,pozmax,pozmin,pozmax2;
int main()
{
fin>>n;
minn=2147483646;
pozmin=0;
maxx=-2147483646;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
if(s[i]-minn>maxx)
{
maxx=s[i]-minn;
pozmax=i;
pozmax2=pozmin;
}
if(s[i]<minn)
{
minn=s[i];
pozmin=i;
}
}
fout<<maxx<<" "<<pozmax2+1<<" "<<pozmax;
fin.close();
fout.close();
return 0;
}