Pagini recente » Cod sursa (job #1267428) | Cod sursa (job #1625113) | Cod sursa (job #872504) | Cod sursa (job #727068) | Cod sursa (job #663899)
Cod sursa(job #663899)
#include <fstream>
using namespace std;
int a[31000],t[31000];
int main()
{
int n,i,j,maxim,s,primul, ultimul;
ifstream fin ("ssm.in");
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a[i];
t[i]=t[i-1]+a[i];
}
fin.close();
maxim=a[1];
for(i=1;i<=n;i++)
for (j=i;j<=n;j++)
{
s=0;
s=t[j]-t[i-1];
if (s>maxim)
{
maxim=s;
ultimul=j;
primul=i;
}
}
ofstream fout ("ssm.out");
fout<<maxim<<" "<<primul<<" "<<ultimul;
fout.close();
return 0;
}