Cod sursa(job #832873)
| Utilizator | Data | 11 decembrie 2012 16:50:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int V[6000010];
int main () {
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,j,sum,smax=-(1 << 30),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;
}
