Cod sursa(job #2926596)
| Utilizator | Data | 18 octombrie 2022 09:53:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,is,js,s[6000010],sum,maxim=-7000000,x;
int main () {
fin>>n;
s[0]=0;
for (i=1;i<=n;i++) {
fin>>x;
s[i]=s[i-1]+x;
}
for (i=1;i<n;i++) {
for (j=i+1;j<=n;j++) {
sum=s[j]-s[i-1];
if (sum>maxim) {
maxim=sum;
is=i;
js=j;
}
}
}
fout<<maxim<<" "<<is<<" "<<js;
return 0;
}
