E - Sequence in the Pocket

浅浅的花香味﹌ 2022-08-28 04:55 4阅读 0赞

传送门：[Sequence in the Pocket][]  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAXzIzXw_size_20_color_FFFFFF_t_70_g_se_x_16]  
**Sample Input**

> 2  
> 4  
> 1 3 2 4  
> 5  
> 2 3 3 5 5

**Sample Output**

> 2  
> 0

![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAXzIzXw_size_20_color_FFFFFF_t_70_g_se_x_16 1]  
代码：

#include<bits/sdc++.h>
    using namespace std;
    int main()
    { 
        int t;
        scanf("%d",&t);
        while(t--){ 
            int a,b,c,d,m;
            scanf("%d",&a);
            m=0;
            int A[a+5];
            int B[a+5];
            int C[a+5];
            memset(A,0,sizeof(A));
            memset(B,0,sizeof(B));
            memset(C,0,sizeof(C));
            for(int i=0;i<a;i++){ 
                scanf("%d",&A[i]);
            }
            b=c=0;
            for(int i=0;i<a;i++){ 
                if(b==0||B[b-1]<=A[i]){ 
                    B[b++]=A[i];
                }else{ 
                    c++;
                    m=max(m,A[i]);
                }
            }
            d=c;
            for(int i=0;i<b;i++){ 
                if(B[i]<m)
                    d++;
                else
                    break;
            }
            printf("%d\n",d);
        }
        return 0;
    }

[Sequence in the Pocket]: https://zoj.pintia.cn/problem-sets/91827364500/problems/91827370499
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAXzIzXw_size_20_color_FFFFFF_t_70_g_se_x_16]: /images/20220828/2e15af99dae541d7829c208cebbd86b6.png
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAXzIzXw_size_20_color_FFFFFF_t_70_g_se_x_16 1]: /images/20220828/0ffe4edac6eb4f56ac820215e30bedf0.png