Pagini recente » Cod sursa (job #101545) | Cod sursa (job #1450058) | Cod sursa (job #3140832) | Cod sursa (job #1354288) | Cod sursa (job #2710429)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,j,maxim,maxi,maxj,x,n,s[6000005];
int main()
{
fin >> n;
fin >> s[1];
for(i=2;i<=n;i++)
{
fin >> x;
s[i]=s[i-1]+x;
}
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
maxi=i;
maxj=j;
}
}
}
fout << maxim << ' ' << maxi << ' ' << maxj;
return 0;
}