Bzoj 4300 Excellent title

Find a good question for Qdez friends Orzorz
DQS seniors watched for two minutes and said, "Silly X"
Well......
All right, Qaq.
Orz

But my program is running faster than DQS.

Bitwise processing. Dp. Recursion.
I think I can give you 56 exams for this question.

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAXN = + 5;
int n,k;
int F[MAXN];

int main ()
{
    scanf ("%d", &n);
    for (int i = 1;i <= n;i + +)
    {
        scanf ("%d", &k);
        int tmp = 0;
        for (int j = 0;j <= 30;j + +)
            if ((K >> j) & 1)
                TMP = MAX (Tmp,f[j] + 1);
        for (int j = 0;j <= 30;j + +)
            if ((K >> j) & 1)
                f[j] = max (tmp,f[j]);
    }
    int ans = 0;
    for (int i = 0;i <= 30;i + +)
        ans = max (ans,f[i]);
    printf ("%d\n", ans);
    return 0;
}