Esercizio3-Giugno 2019 (RAVIZ)

#include <stdio.h>
#include <stdlib.h>
#define N 13

int main()
{
    int v[N]={0, 3, 3, -1, -7, 1, 5, 4, 2, -4, 2, 0, 2};
    int c[N];

    c[1]=v[1];
    for(int i=2;i<N;i++){
        if(((v[i]%2==0 && v[i-1]%2==0) || (v[i]%2!=0 && v[i-1]%2!=0)) && c[i-1]>0)
            c[i]=v[i]+c[i-1];
        else
            c[i]=v[i];
    }
    for(int i=1;i<N;i++){
        printf("%d, ",c[i]);
    }


    int max=c[1];
    int position[N];
    for(int i=2;i<N;i++)
        if(c[i]>max)
            max=c[i];

    printf("\n%d\n",max);


    int sum=0;
    int calculatinSubVect=0;
    for(int i=N-1;i>=1;i--){
        if(c[i]==max && calculatinSubVect==0){
            calculatinSubVect=1;
            printf("[ ");
        }
        if(calculatinSubVect==1){
            sum+=v[i];
            printf("%d", v[i]);
            if(sum==max){
                printf(" ]\n");
                calculatinSubVect=0;
                sum=0;
            }else{
                printf(", ");
            }
        }
    }

    return 0;


}