Cod sursa(job #1149176)
Utilizator | Data | 21 martie 2014 15:21:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[6000001],s[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++)s[i]=s[i-1]+v[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
sc=s[j]-s[i-1];
if(sc>smax)
{
smax=sc;
start=i;
end=j;
}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}