Cod sursa(job #2754186)
| Utilizator | Data | 25 mai 2021 12:58:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int n,i,m,aux,j,k,l,maxim,p,maximi,maximj;
int v[6000002];
long long s[6000002];
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main () {
cin>>n;
for (i=1;i<=n;i++) {
cin>>v[i];
s[i]=s[i-1]+v[i];
}
for (i=2;i<=n;i++) {
for (j=1;j<=i-1;j++) {
if (s[i]-s[j-1]>maxim) {
maxim=s[i]-s[j-1];
maximi=i;
maximj=j;
}
}
}
cout<<maxim<<" "<<maximj<<" "<<maximi;
}
