Cod sursa(job #547308)
Utilizator | Data | 6 martie 2011 11:15:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int v[100],i,j,n,st,end,k,s=0,max=0;
fin>>n;
for(i=0;i<n;i++) fin>>v[i];
for(i=0;i<n;i++)
for(j=i;j<n;j++) {
s=0;
for(k=i;k<=j;k++) s=s+v[k];
if(s>max) { max=s;st=i;end=j; }
}
fout<<max<<" "<<st+1<<" "<<end+1<<"\n";
return 0;
}