zoukankan      html  css  js  c++  java
  • codeforces 894 A题 QAQ

    A. QAQ
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    "QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.

    Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the string (Diamond is so cute!).

    Bort wants to know how many subsequences "QAQ" are in the string Diamond has given. Note that the letters "QAQ" don't have to be consecutive, but the order of letters should be exact.

    Input

    The only line contains a string of length n (1 ≤ n ≤ 100). It's guaranteed that the string only contains uppercase English letters.

    Output

    Print a single integer — the number of subsequences "QAQ" in the string.

    Examples
    Input
    QAQAQYSYIOIWIN
    Output
    4
    Input
    QAQQQZZYNOIWIN
    Output
    3
    Note

    In the first example there are 4 subsequences "QAQ": "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN".

     题意:给一个长度 不超过 100 的字符串 , 统计 QAQ 的出现次数 , (QAQ的出现次数 :QAQ 不一定要是连续的 , 但是位置上 一定是 A的两边各有一个Q)

    思路:前缀和 计算 第 i 个位置 和之前一共出现了多少个 Q , 则遍历枚举 A 累加 A之前 和 A之后 的零的个数的乘积。

    #include <cstdio>
    #include <iostream>
    #include <algorithm>
    #include <cstring>
    
    using namespace std ;
     
    #define LL long long 
    #define maxn 200 
    char str[maxn] ; 
    int sum[maxn] ; 
    
    int main(){
        
        while(~scanf(" %s" , str )){
            memset(sum , 0 , sizeof(sum)) ; 
            int num = 0 ; 
            int len = strlen(str) ; 
            for(int i=0 ; i<len ; i++){
                if(str[i] =='Q'){
                    num ++ ; 
                }
                
                sum[i] = num ; 
            }
            LL result = 0 ; 
            for(int i=0 ; i<len ; i++){
                if(str[i] =='A')
                result += sum[i] * (sum[len - 1]-sum[i]) ; 
            }
            
            printf("%lld
    " , result) ; 
        }
        
        return 0 ;
    } 
  • 相关阅读:
    前方高能!!!一大泼干货来袭。。。。
    spring-cloud-gateway(三)自定义lb实现
    spring-cloud-gateway(二)es代理功能需求
    spring-cloud-gateway(一)代码分析
    一个spark MurmurHash map类加器
    hbase RegionTooBusyException报错异常处理
    hbase HexStringSplit 预分区
    spark读写hbase的几种方式,及读写相关问题
    实现elasticsearch网关,兼容不同版本es,滚动升级-功能验证开发
    k8s平台集成kong ingress 布署konga集成ui
  • 原文地址:https://www.cnblogs.com/yi-ye-zhi-qiu/p/7865997.html
Copyright © 2011-2022 走看看