21 Days Training // Day 1~4

2. poster

Constraints :

For Subtask 1,2 : enum.
Code :

#include 
using namespace std;

int main() {
    long long N;cin >> N;
    long long A[N];
    for (long long i=0;i> A[i];
    long long Q;cin >> Q;
    long long smax=0;
    for (long long k=0;k<(1<<N);k++) {
        long long score=0;
        for (long long i=0;i<N;i++) {
            if (k&(1<<i)) {
                if ((k&(1<<((i+1)%N))&&(k&(1<<((i+2)%N)))&&(k&(1<<((i+3)%N))))) {
                    goto L0_stat_end;
                }
                score += A[i];
            }

        }
        smax = max(smax, score);
        L0_stat_end: ;
    }
    cout << smax << endl;
    for (long long i=0;i> T >> Ax;T--;
        A[T] = Ax;
        smax=0;
        for (long long k=0;k<(1<<N);k++) {
            long long score=0;
            for (long long j=0;j<N;j++) {
                if (k&(1<<j)) {
                    if ((k&(1<<((j+1)%N))&&(k&(1<<((j+2)%N)))&&(k&(1<<((j+3)%N))))) {
                        goto L1_stat_end;
                    }
                    score += A[j];  
                }
            }
            smax = max(smax, score);
            L1_stat_end: ;
        }
        cout << smax << endl;
    }

    return 0;
}

Solution