Pagini recente » Cod sursa (job #211359) | Cod sursa (job #1492770) | Cod sursa (job #2498646) | Cod sursa (job #1430842) | Cod sursa (job #1850915)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int maxim,n,v[100000],p[100000],i;
f>>n;
int j;
for(i=n-1;i>=0;i--)
{
f>>v[i];
}
for(i=0;i<n;i++)
p[i]=0;
maxim=v[0];
for(int i=1;i<n;i++)
if(v[i]+v[i-1]>v[i])
{v[i]+=v[i-1];
p[i]=n-i+1;
}
// for(int i=n-1;i>=0;i--)
// g<<p[i]<<" ";
// g<<"\n";
for(int i=0;i<n;i++)
if(maxim<v[i])
{maxim=v[i];
j=i;
}
i=j;
while(p[i])
{
i=p[n-i];
}
g<<maxim<<" ";
g<<j<<" ";
g<<i;
}