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