Pagini recente » Cod sursa (job #946841) | Cod sursa (job #2360072) | Cod sursa (job #304706) | Cod sursa (job #1649064) | Cod sursa (job #3335485)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001];
int main()
{
int n , i , j , max=0 , imax=0 , jmax=0;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
v[i]+=v[i-1];
}
for(j=0; j<=n; j++)
{
for(i=0; i+j<n; i++)
{
if(v[i+j]-v[i]>max)
{
max=v[i+j]-v[i];
imax=i+1;
jmax=i+j;
}
}
}
fout<<max<<" "<<imax<<" "<<jmax;
return 0;
}