RC-[CF]101028J-X and Beasts

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int a[110];
 4 int dp[110], w[110];
 5  
 6 int main()
 7 {
 8     int t;
 9     int n;
10     scanf("%d", &t);
11     while(t--)
12     {
13         scanf("%d", &n);
14         for (int i = 0; i < n;i++)
15         {
16             int tp = 2, cnt = 0;
17             scanf("%d", &a[i]);
18             while(a[i]%tp==0)
19             {
20                 tp *= 2;
21                 cnt++;
22             }
23             dp[i] = cnt;
24             w[i] = cnt;
25         }
26         for (int i = 0; i < n;i++)
27             for (int j = 0; j < i;j++)
28                 if(a[j]<a[i])
29                     dp[i] = max(dp[i], dp[j] + w[i]);
30         int ans = 0;
31         for (int i = 0; i < n;i++)
32             ans = max(ans, dp[i]);
33         cout << ans << endl;
34     }
35 }