Pagini recente » Cod sursa (job #937211) | Cod sursa (job #2802649) | Cod sursa (job #2906082) | Monitorul de evaluare | Cod sursa (job #1791247)
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[100023],i,p1,p2,sc,smax,aux;
long long sum;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
sc=0; smax=-999999; p1=1; p2=0;
for(i=1;i<=n;++i)
{
sc+=a[i];
if(sc<a[i])
{
sc=a[i];
aux=i;
}
if(sc>smax)
{
smax=sc;
p2=i;
p1=aux;
}
}
for(i=p1;i<=p2;++i)
sum+=a[i];
g<<sum<<" "<<p1<<" "<<p2;
return 0;
}