zoukankan      html  css  js  c++  java
  • (数学)cf 451D

    D. Count Good Substrings
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "aabba" is good, because after the merging step it will become "aba".

    Given a string, you have to find two values:

    1. the number of good substrings of even length;
    2. the number of good substrings of odd length.
    Input

    The first line of the input contains a single string of length n (1 ≤ n ≤ 105). Each character of the string will be either 'a' or 'b'.

    Output

    Print two space-separated integers: the number of good substrings of even length and the number of good substrings of odd length.

    Sample test(s)
    input
    bb
    output
    1 2
    input
    baab
    output
    2 4
    input
    babb
    output
    2 5
    input
    babaa
    output
    2 7
    Note

    In example 1, there are three good substrings ("b", "b", and "bb"). One of them has even length and two of them have odd length.

    In example 2, there are six good substrings (i.e. "b", "a", "a", "b", "aa", "baab"). Two of them have even length and four of them have odd length.

    In example 3, there are seven good substrings (i.e. "b", "a", "b", "b", "bb", "bab", "babb"). Two of them have even length and five of them have odd length.

    Definitions

    A substring s[l, r(1 ≤ l ≤ r ≤ n) of string s = s1s2... sn is string slsl + 1... sr.

    A string s = s1s2... sn is a palindrome if it is equal to string snsn - 1... s1.

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    #define LL long long
    char s[100010];
    LL a[3][3];
    int main()
    {
          cin>>s;
          int len=strlen(s);
          LL even=0,odd=0;
          for(int i=0;s[i];i++)
          {
                int  x=s[i]-'a';
                a[x][i%2]++;
                even+=a[x][!(i%2)];
                odd+=a[x][i%2];
          }
          printf("%I64d %I64d
    ",even,odd);
          return 0;
    }
    

      

  • 相关阅读:
    SharePoint 2013 Nintex Workflow 工作流帮助(十二)
    SharePoint 2013 Nintex Workflow 工作流帮助(十一)
    win32-GetActiveWindow和GetForegroundWindow
    win32
    win32-ReadProcessMemory在x86和x64下运行
    win32-FileTimeToSystemTime的使用
    win32-改变显示器的亮度
    win32-改变Combox的编辑框和下拉列表的背景颜色和文本字体颜色
    C++ 析构函数的调用顺序
    win32-制作mini dump文件
  • 原文地址:https://www.cnblogs.com/a972290869/p/4241791.html
Copyright © 2011-2022 走看看