Cod sursa(job #1789189)
Utilizator | Data | 26 octombrie 2016 19:22:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int dr,nrmaxi,st,i,n,k,t,j,x[100005],a,nr,p,Smaxi;
long long s;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
Smaxi=x[1];
s=x[1];
st=1;
dr=1;
for(i=2;i<=n;i++)
{
if(s+x[i]>x[i])
s=s+x[i];
else
{
s=x[i];
st=i;
}
if(s>Smaxi)
{
Smaxi=s;
dr=i;
}
}
g<<Smaxi<<" "<<st<<" "<<dr;
return 0;
}