Pagini recente » Cod sursa (job #696914) | Cod sursa (job #415644) | Cod sursa (job #35352) | Cod sursa (job #1784720) | Cod sursa (job #1979387)
#include <fstream>
using namespace std;
int n,v[6000007],maxim=0,suma=0,primul,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; k++)
{
for(int j=k; j<=k+i-1; j++)
{
suma+=v[j];
if(maxim<suma)
{
maxim=suma;
primul=k;
ultimul=k+i-1;
}
}
suma=0;
}
}
fout<<maxim<<" "<<primul<<" "<<ultimul;
}