Pagini recente » Cod sursa (job #1999355) | Cod sursa (job #1310531) | Cod sursa (job #2684693) | Cod sursa (job #1247060) | Cod sursa (job #1144983)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int lis[6000001];
int main()
{
int a,b,max=-1000000,i,n,k,x,y;
fin>>n;
a=x=1;
y=b=1;
fin>>k;
lis[0]=k;
max=lis[0];
for(i=1;i<n;i++)
{
fin>>k;
if(lis[i-1]+k<k)
{
lis[i]=k;
a=i+1;
b=i+1;
}
else
{
lis[i]=lis[i-1]+k;
b=i+1;
}
if(lis[i]>max) max=lis[i],x=a,y=b;
}
if(lis[i]>max) max=lis[i],x=a,y=b,a=i+1,b=i+1;
fout<<max<<" "<<x<<" "<<y;
}