Cod sursa(job #1245226)
Utilizator | Data | 18 octombrie 2014 19:37:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#define DMAX 6000004
using namespace std;
int t[DMAX], n;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int pr, ul, x, y, sum=0, smax=0;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>t[i];
sum+=t[i];
if(sum>smax) smax=sum, pr=x, ul=y;
else if(sum<0) x=i+1, y=i, sum=0;
y++;
}
fout<<smax<<' '<<pr<<' '<<ul<<'\n';
return 0;
}