Cod sursa(job #668911)
Utilizator | Traista traista.lamaita | Data | 25 ianuarie 2012 20:29:37 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include<algorithm>
using namespace std;
#define Max(a, b) ((a) > (b) ? (a) : (b))
const int MAXN = 7000005;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n, s, smax,k,inc,sf, v[MAXN];
int bestSum = -int(2e9);// ??
int main()
{f>>n;
for(i=1;i<=n;++i) f>>v[i];
for(i=1;i<=n;++i)
{if(s<0)
{s=v[i]; k=i;}
else s+=v[i];
if (bestSum < s)
{bestSum = s; inc = k; sf = i;}
}
g<< bestSum << " " << inc << " " << sf;
g.close();
return 0;
}