Cod sursa(job #2611587)
Utilizator | Esterabadeyan Hadi Gligar | Data | 7 mai 2020 10:03:28 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int nmax=6000000;
int v[nmax+1];
int s[nmax+1];
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
s[i]=s[i-1]+v[i];
//fout<<s[i]<<" ";
}
int sol=v[1],l=1,ll=1;
for(int i=0;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(s[j]-s[i]>sol){
sol=s[j]-s[i];
l=i+1;
ll=j;
}
}
}
fout<<sol<<" "<<l<<" "<<ll;
return 0;
}