Cod sursa(job #2390548)
| Utilizator | Data | 28 martie 2019 10:34:11 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#define N 1001
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
int v[N];
int n, g, k = 2, max = -100, s = 0, j;
fin>>n;
for(int i = 1; i <= n; ++i)
fin>>v[i];
for(int i = 1; i <= n-1; ++i){
g = 0;
j = 1;
while(g < n - i){
while(j <= k){
s += v[j];
++j;
}
if(s > max)
max = s;
j=1;
j += k;
k += k;
++g;
}
++k;
}
fout<<s;
}
