HDU 5907 Find Q (水题)

Posted dwtfukgv

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU 5907 Find Q (水题)相关的知识,希望对你有一定的参考价值。

题意:在他眼前有一个小写字母组成的字符串SSS,他想找出SSS的所有仅包含字母‘q‘的连续子串。

析:这个题,很容易发现,有 n 个连续个q,就是前 n 项和。注意不要超 int。

代码如下:

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
//#include <tr1/unordered_map>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;
//using namespace std :: tr1;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const LL LNF = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e5 + 5;
const LL mod = 10000000000007;
const int N = 1e6 + 5;
const int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1};
const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
inline LL gcd(LL a, LL b){  return b == 0 ? a : gcd(b, a%b); }
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}
char s[maxn];
LL sum[maxn];

int main(){
    sum[0] = 0;
    for(int i = 1; i <= 100002; ++i)  sum[i] = sum[i-1] + i;
    int T;  cin >> T;
    while(T--){
        scanf("%s", s);
        n = strlen(s);
        LL ans = 0;
        int cnt = 0;
        for(int i = 0; i < n; ++i){
            if(s[i] == ‘q‘) ++cnt;
            else if(cnt){
                ans += sum[cnt];
                cnt = 0;
            }
        }
        ans += sum[cnt];
        cout << ans << endl;
    }
    return 0;
}

 

以上是关于HDU 5907 Find Q (水题)的主要内容,如果未能解决你的问题,请参考以下文章

HDU 5907 Find Q(字符串)

HDU 5980 Find Small A (水题)

HDU6292 赛题分析水题

HDU2612 find a way

水题 codeforces 133A - HQ9+ && sting类find系列函数简单总结

题解报告:hdu1994利息计算