Pagini recente » Cod sursa (job #6875) | Cod sursa (job #380038) | Cod sursa (job #341766) | Statisticile problemei Vrejuri | Cod sursa (job #1179569)
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,j,s[6000000],d,im,jm,maxi;
int main()
{
f>>n;
for(i=1;i<=n;++i) { f>>s[i];
s[i]+=s[i-1];
}
maxi=s[2]-s[1];
for(i=1;i<=n;++i) for(j=i+1;j<=n;++j) { d=s[j]-s[i];
if(d>maxi) { maxi=d;
im=i+1;
jm=j;
}
}
g<<maxi<<" "<<im<<" "<<jm;
f.close();
g.close();
return 0;
}