zoukankan      html  css  js  c++  java
  • 1093 Count PAT's (25 分)

    The string APPAPT contains two PAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.

    Now given any string, you are supposed to tell the number of PAT's contained in the string.

    Input Specification:

    Each input file contains one test case. For each case, there is only one line giving a string of no more than 1 characters containing only PA, or T.

    Output Specification:

    For each test case, print in one line the number of PAT's contained in the string. Since the result may be a huge number, you only have to output the result moded by 1000000007.

    Sample Input:

    APPAPT
     

    Sample Output:

    2



    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1000000;
    int leftNumP[maxn]={0};
    int main(){
        string s;
        cin>>s;
        int len=s.length();
        for(int i=0;i<len;i++){
            if(i>0){
                leftNumP[i]=leftNumP[i-1];
            }
            if(s[i]=='P'){
                leftNumP[i]++;
            }
        }
        int ans=0,rightNumT=0;
        for(int i=len-1;i>=0;i--){
            if(s[i]=='T'){
                rightNumT++;
            }
            else if(s[i]=='A'){
                ans=(ans+leftNumP[i]*rightNumT)%1000000007;
            }
        }
        printf("%d
    ",ans);
        return 0;
    }
    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1000000;
    int leftNumP[maxn]={0};
    int main(){
        string s;
        cin>>s;
        int len=s.length();
        for(int i=0;i<len;i++){
            if(i>0){
                leftNumP[i]=leftNumP[i-1];
            }
            if(s[i]=='P'){
                leftNumP[i]++;
            }
        }
        int ans=0,rightNumT=0;
        for(int i=len-1;i>=0;i--){
            if(s[i]=='T'){
                rightNumT++;
            }
            else if(s[i]=='A'){
                ans=(ans+leftNumP[i]*rightNumT)%1000000007;
            }
        }
        printf("%d
    ",ans);
        return 0;
    }
  • 相关阅读:
    第二阶段冲刺站立会议报告
    09软件工程读后感之三
    08软件工程读后感之二
    07软件工程读后感之一
    一个整数数组中最大字数组二
    返回一个二维数组最大联通子数组的和
    项目阶段总结
    大道至简阅读笔记之三
    大道至简阅读笔记二
    课堂设计
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14491490.html
Copyright © 2011-2022 走看看