Cod sursa(job #1005178)
| Utilizator | Data | 4 octombrie 2013 14:01:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 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,inceput,sfarsit,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,inceput=start,sfarsit=i;
}
g<<Smax<<' '<<inceput<<' '<<sfarsit<<'\n';
f.close();g.close();
return 0;
}
