Pagini recente » Cod sursa (job #910234) | Cod sursa (job #2872149) | Cod sursa (job #1527959) | Cod sursa (job #1507203) | Cod sursa (job #2712787)
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
long long n,k,i,v[50002],stm,drm,st,l=0;
long long s,maxi;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
k=1;
while(k<n)
{
for(i=1; i<=n; i++)
{
if(st>n-k+1)i=n+1;
else
{s=s+v[i];
l++;
if(l==1)st=i;
if(s>maxi && l==k)
{
maxi=s;
stm=st;
drm=i;
s=0;
}
if(l==k)
{
l=0;
s=0;
i=st;
}
}}
k++;
s=0;
l=0;
st=0;
}
fout<<maxi<<" "<<stm<<" "<<drm;
return 0;
}