Pagini recente » Cod sursa (job #1670395) | Cod sursa (job #1109578) | Cod sursa (job #973439) | Cod sursa (job #32903) | Cod sursa (job #277605)
Cod sursa(job #277605)
#include<fstream.h>
#include<math.h>
ifstream f("ssm.in");
ofstream g("ssm.out");
int main ()
{
long a[20000],n,i,j,k,ind1,ind2,max,s;
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
max=0;
for (i=1; i<n; i++)
for (j=1; j<=n; j++)
{
s=0;
for (k=i; k<=j; k++)
s+=a[k];
if (s>max) { max=s; ind1=i; ind2=j; }
}
g<<max<<" "<<ind1<<" "<<ind2;
return 0;
}