Pagini recente » Cod sursa (job #2093203) | Cod sursa (job #99241) | Cod sursa (job #914198) | Cod sursa (job #2181695) | Cod sursa (job #2872253)
#include <iostream>
#include <fstream>
using namespace std;
int v[6000007],s[600007],n,i,start,stop,maxim;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(v[i]>v[i]+s[i-1])
s[i]=v[i];
else
s[i]=v[i]+s[i-1];
}
for(i=1;i<=n;i++)
if(s[i]>maxim)
maxim=s[i],stop=i;
g<<maxim;
for(i=stop;i>=1;i--)
{
if(s[i]-v[i]==s[i-1])
start=i-1;
else
break;
}
g<<" "<<start<<" "<<stop;
return 0;
}