Pagini recente » Cod sursa (job #1006747) | Cod sursa (job #167958) | Cod sursa (job #2496968) | Cod sursa (job #2030114) | Cod sursa (job #2081753)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000001];
int s[6000001];
int main()
{
int j,n,maxim=0,Li,Lf,i;
f>>n;
s[0]=0;
for(i=1;i<=n;i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
Li=i;
Lf=j;
}
}
}
g<<maxim<<' '<<Li<<' '<<Lf;
return 0;
f.close();
g.close();
}