Cod sursa(job #1149175)
Utilizator | Data | 21 martie 2014 15:21:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<limits.h>
#include<fstream>
using namespace std;
#define dim 6000005
ifstream in("ssm.in");
ofstream out("ssm.out");
int s[dim];
int main()
{
int n,i,su,smax,st,dr,j,x;
in>>n;
s[0]=0;
for(i=1;i<=n;++i)
{
in>>x;
s[i]=s[i-1]+x;
}
smax=INT_MIN;
for(i=1;i<=n;++i)
for(j=i;j<=n;++j)
{
su=s[j]-s[i-1];
if(su>smax)
{
smax=su;
st=i;
dr=j;
}
}
out<<smax<<" "<<st<<" "<<dr;
return 0;
}