Pagini recente » Cod sursa (job #2043956) | Cod sursa (job #378445) | Arbori de intervale si aplicatii in geometria computationala | Cod sursa (job #2414979) | Cod sursa (job #597940)
Cod sursa(job #597940)
#include <fstream>
using namespace std;
int a[6000001];
int n;
int s=-2000000000,best;
int x,y,t;
int i;
bool b=0;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
for (i=1; i<=n; i++)
{
f >> a[i];
if (a[i]>0) b=1;
}
int min=0;
for (i=2; i<=n; i++)
a[i]+=a[i-1];
for (i=1; i<=n; i++)
{
best=a[i]-min;
if (min>a[i])
{
min=a[i];
t=i+1;
}
if (best>s)
{
s=best;
x=t;
y=i;
}
}
if (x==0 || x>y) x=1;
if (s<0) x=y;
g << s << ' ' << x << ' ' << y;
return 0;
}