zoukankan      html  css  js  c++  java
  • LA 6439 Pasti Pas! Hash

    直接默认hash不会冲突,其实很多现成的字符串hash算法是很优秀的。。。大概率可以水过。。。。

    然后从两端往中间搞一搞,特殊处理一下中间的情况就好。

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <map>
    #include <set>
    #include <vector>
    #include <string>
    #include <queue>
    #include <deque>
    #include <bitset>
    #include <list>
    #include <cstdlib>
    #include <climits>
    #include <cmath>
    #include <ctime>
    #include <algorithm>
    #include <stack>
    #include <sstream>
    #include <numeric>
    #include <fstream>
    #include <functional>
    
    using namespace std;
    
    #define MP make_pair
    #define PB push_back
    typedef long long LL;
    typedef unsigned long long ULL;
    typedef vector<int> VI;
    typedef pair<int,int> pii;
    const int INF = INT_MAX / 3;
    const double eps = 1e-8;
    const LL LINF = 1e17;
    const double DINF = 1e60;
    const int maxn = 50000 + 5;
    const int mod = 65536;
    char S[maxn];
    
    void solve() {
        int len = strlen(S);
        int lb = 0, rb = len - 1;
        LL lhash = 0,rhash = 0,rp = 1;
        int ans = 0;
        bool pp = false;
        while(lb <= rb) {
            //BKDRHash
            lhash = lhash * 131 + S[lb];
            rhash = rhash + rp * S[rb]; rp *= 131;
            if(lhash == rhash) {
                if(lb == rb) ans++;
                else ans += 2;
                lhash = rhash = 0;
                rp = 1;
                pp = true;
            }
            else pp = false;
            lb++; rb--;
        }
        ans += (int)!pp;
        printf("%d
    ",ans);
    }
    
    int main() {
        int T; scanf("%d",&T);
        for(int kase = 1;kase <= T;kase++) {
            scanf("%s",S);
            printf("Case #%d: ",kase);
            solve();
        }
        return 0;
    }
    
  • 相关阅读:
    c#之静态构造函数和单例模式
    ugui之圆角矩形头像实现
    一些网站
    unity3d之实现各种滑动效果
    unity3d之切换场景不销毁物体
    unity3d之技能栏冷却
    unity3d之控制人物转向移动并播放动画
    vs常用快捷键
    构造函数的继承
    编写可维护的javascript 随笔
  • 原文地址:https://www.cnblogs.com/rolight/p/3950164.html
Copyright © 2011-2022 走看看