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!).

    illustration by 猫屋 https://twitter.com/nekoyaliu

    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".

    题目大意:找字符串QAQ出现的次数.

    分析:题目数据范围不大,三种暴力循环就可以过,事实上有O(n)的写法,设f[i][1/2/3]分别为前i位匹配了1/2/3位的方案数,对于每一位判断一下是否等于Q或A,非常简单地转移一下就好了.

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <stack>
    #include <algorithm>
    
    using namespace std;
    
    char s[1010];
    int f[1010][4], len;
    
    int main()
    {
        scanf("%s", s + 1);
        len = strlen(s + 1);
        for (int i = 1; i <= len; i++)
        {
            f[i][1] = f[i - 1][1];
            f[i][2] = f[i - 1][2];
            f[i][3] = f[i - 1][3];
            if (s[i] == 'Q')
            {
                f[i][1]++;
                f[i][3] += f[i - 1][2];
            }
            if (s[i] == 'A')
                f[i][2] += f[i - 1][1];
        }
        printf("%d
    ", f[len][3]);
    return 0;
    }
  • 相关阅读:
    通过API方式查看Azure Sign-ins记录
    定期删除Azure存储账号下N天之前的数据文件-ASM
    定期删除Azure存储账号下N天之前的数据文件-ARM
    使用自定义映像批量创建托管磁盘虚拟机
    CentOS6.9 ARM虚拟机扩容系统磁盘
    Linux小技巧
    mysql数据导到本地
    mac安装pkg 一直“正在验证” 卡着
    idea compare功能 之一次bug修复
    番茄三月账单
  • 原文地址:https://www.cnblogs.com/zbtrs/p/8032972.html
Copyright © 2011-2022 走看看