Cod sursa(job #1149196)
Utilizator | Data | 21 martie 2014 15:27:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,s[6000001];
int main()
{
int x,i,j,sc,smax=INT_MIN,start,end;
in>>n;
for(i=1;i<n;++i)
{
in>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n;++i)
for(j=i;j<=n;++j)
{
s=0;
sc=s[j]-s[i-1];
if(sc>smax)
{
smax=sc;
start=i;
end=j;
}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}