Pagini recente » Cod sursa (job #1104727) | Cod sursa (job #3294192) | Cod sursa (job #258217) | Cod sursa (job #254566) | Cod sursa (job #1430633)
#include <fstream>
#define Xp 6000006
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[Xp];
long long a,i,j,b,c,mix,suma,n;
int main()
{
f>>n;
for(i=1;i<=n;i++) {f>>a; suma+=a; v[i]=suma;}
for(i=n;i>=1;i--)
for(j=1;j<i;j++)
{
if(mix==v[i]-v[j]) {if((v[b]-v[b-1]==v[j]-v[j-1] && (i-j+1) < (c-b+1))||(v[b]-v[b-1] > v[j]-v[j-1])) {b=j; c=i;}}
else if(mix<v[i]-v[j]) {mix=v[i]-v[j]; b=j+1; c=i;}
}
g<<mix<<" "<<b<<" "<<c;
g.close();
return 0;
}