Cod sursa(job #1515821)
| Utilizator | Data | 2 noiembrie 2015 11:09:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
long long n,i,v[6000002],s[6000002],maxim,j,p,u;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main (){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
s[i] = s[i-1] + v[i];
}
for (i=1;i<n;i++){
for (j=i;j<=n;j++){
if ((s[j]-s[i-1]) > maxim){
maxim = (s[j]-s[i-1]);
p = i;
u = j;
}
}
}
fout<<maxim<<" "<<p<<" "<<u;
return 0;
}
