Cod sursa(job #1005173)
| Utilizator | Data | 4 octombrie 2013 13:52:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define Nmax 6000099
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,S[Nmax],Smax=-int(2e9),sum,beg,end,start;
int main()
{
f>>N;
for(int i=1;i<=N;i++)f>>S[i];
for(int i=1;i<=N;i++)
{
if (sum<0)sum=S[i],start=i;
else sum += S[i];
if (sum>Smax)Smax=sum,beg=start,end=i;
}
g<<Smax<<' '<<beg<<' '<<end<<'\n';
f.close();g.close();
return 0;
}
