Cod sursa(job #832869)
Utilizator | paslaru madalin cristian madalincp | Data | 11 decembrie 2012 16:47:34 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int main () {
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int V[1000000];
int n,i,j,sum,smax=0,a,b;
fin>>n;
for(int x=1;x<=n;x++)
fin>>V[x];
for(i=1;i<=n;i++){
sum=0;
for(j=i;j<=n;j++){
sum+=V[j];
if(smax<sum){
smax=sum;
a=i;
b=j;
}
}
}
fout<<smax<<' '<<a<<' '<<b<<' '<<endl;
return 0;
}