Pagini recente » Cod sursa (job #1217043) | Cod sursa (job #2290761) | Cod sursa (job #2926894) | Cod sursa (job #2152102) | Cod sursa (job #2854021)
#include <iostream>
#include <fstream>
using namespace std;
fstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,st,dr,j,suma;
fin>>n;
int v[n];
for(i=1; i<=n; i++)
{
fin>>v[i];
}
int sp[n];
sp[0]=0;
for(i=1; i<=n; i++)
{
sp[i]=sp[i-1]+v[i];
}
int min_st[n+1],maxim=v[1],dr_max=1,st_max=1;
min_st[0]=0;
for(i=1; i<=n; i++)
{
if(sp[i]<sp[min_st[i-1]])
{
min_st[i]=i-1;
}
else
{
min_st[i]=min_st[i-1];
}
}
for(dr=1; dr<=n; dr++)
{
st=min_st[dr]+1;
suma=sp[dr]-sp[st-1];
if(suma>maxim)
{
maxim=suma;
st_max=st;
dr_max=dr;
}
}
fout<<maxim<<" "<<st_max<<" "<<dr_max;
return 0;
}