Pagini recente » Cod sursa (job #2660020) | Cod sursa (job #1958810) | Cod sursa (job #2689463) | Cod sursa (job #743608) | Cod sursa (job #2643323)
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
unsigned long long n,max_i=1,max_j=1;
long long *v,*s,max;
f>>n;
v=new long long[n];
s=new long long[n];
for(unsigned long long i=0;i<n;++i)
s[i]=0;
for(unsigned long long i=0;i<n;++i)
{
f>>v[i];
for(unsigned long long j=0;j<=i;++j)
s[i]+=v[j];
}
max=s[0];
for(unsigned long long i=0;i<n-1;++i)
for(unsigned long long j=i+1;j<n;++j)
if(max<s[j]-s[i])
{
max=s[j]-s[i];
max_i=i+1;
max_j=j+1;
}
g<<max<<' '<<max_i<<' '<<max_j;
delete v;
delete s;
f.close();
g.close();
}