Cod sursa(job #638706)
Utilizator | Ioan Yan yani | Data | 21 noiembrie 2011 14:35:10 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream.h>
#include<fstream.h>
#define NM 10000
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(){
int n,v[NM],i,j,k,smax,end=1,st=1;
smax=v[0];
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<=n;i++)
for(j=i;j<n;j++){
int sc=0;
for(k=i;k<=j;k++)
sc+=v[k];
if(sc>smax)
{smax=sc;
st=i;
end=j;
}
}
out<<smax<<" "<<st<<" "<<end;
return 0;
}