Pagini recente » Cod sursa (job #2009160) | Cod sursa (job #1635220) | Cod sursa (job #1305225) | Cod sursa (job #3257976) | Cod sursa (job #1979390)
#include <fstream>
using namespace std;
int n,v[6000007],maxim=0,suma=0,primul=6000007,ultimul;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(int i=1; i<=n; i++) fin>>v[i];
for(int i=1; i<=n; i++)
{
for(int k=1; k<=n-i+1; k++)
{
for(int j=k; j<=k+i-1; j++)
{
suma+=v[j];
if(maxim<suma)
{
maxim=suma;
if(primul>k)
{
primul=k;
ultimul=k+i-1;
}
}
}
suma=0;
}
}
fout<<maxim<<" "<<primul<<" "<<ultimul;
}