zoukankan      html  css  js  c++  java
  • T端PVP头衔获得NPC脚本

     次代码是一个T端的脚本。通过击杀的角色数量等级来获得不同的头衔。
    
    下面的Ranks就是击杀的数量。根据你的击杀数量,你可以到NPC那里去领取对应的头衔等级
    
    #include "ScriptPCH.h" 
     
    enum Ranks
    {
        RANK_1    = 50,
        RANK_2    = 100,
        RANK_3    = 500,
        RANK_4    = 1000,
        RANK_5    = 2000,
        RANK_6    = 4000,
        RANK_7    = 5000,
        RANK_8    = 6000,
        RANK_9    = 8000,
        RANK_10 = 10000,
        RANK_11 = 12500,
        RANK_12 = 15000,
        RANK_13 = 20000,
        RANK_14 = 25000,
    };
     
    class PVPTitles : public PlayerScript
    {
    public:
        PVPTitles() : PlayerScript("PVPTitles") { }
     
        void OnPVPKill(Player *Killer, Player *Killed) 
        {
    
    // 如果是自杀
    if (Killer->GetGUID() == Killed->GetGUID()) return; uint32 team = killer->GetTeam();  //战场荣誉击杀数量
    switch(Killer->GetUInt32Value(PLAYER_FIELD_LIFETIME_HONORABLE_KILLS)) { case RANK_1: Killer->SetTitle(sCharTitlesStore.LookupEntry(1 + (team == ALLIANCE ? 0 : 14)); break; case RANK_2: Killer->SetTitle(sCharTitlesStore.LookupEntry(2 + (team == ALLIANCE ? 0 : 14)); break; case RANK_3: Killer->SetTitle(sCharTitlesStore.LookupEntry(3 + (team == ALLIANCE ? 0 : 14)); break; case RANK_4: Killer->SetTitle(sCharTitlesStore.LookupEntry(4 + (team == ALLIANCE ? 0 : 14)); break; case RANK_5: Killer->SetTitle(sCharTitlesStore.LookupEntry(5 + (team == ALLIANCE ? 0 : 14)); break; case RANK_6: Killer->SetTitle(sCharTitlesStore.LookupEntry(6 + (team == ALLIANCE ? 0 : 14)); break; case RANK_7: Killer->SetTitle(sCharTitlesStore.LookupEntry(7 + (team == ALLIANCE ? 0 : 14)); break; case RANK_8: Killer->SetTitle(sCharTitlesStore.LookupEntry(8 + (team == ALLIANCE ? 0 : 14)); break; case RANK_9: Killer->SetTitle(sCharTitlesStore.LookupEntry(9 + (team == ALLIANCE ? 0 : 14)); break; case RANK_10: Killer->SetTitle(sCharTitlesStore.LookupEntry(10 + (team == ALLIANCE ? 0 : 14)); break; case RANK_11: Killer->SetTitle(sCharTitlesStore.LookupEntry(11 + (team == ALLIANCE ? 0 : 14)); break; case RANK_12: Killer->SetTitle(sCharTitlesStore.LookupEntry(12 + (team == ALLIANCE ? 0 : 14)); break; case RANK_13: Killer->SetTitle(sCharTitlesStore.LookupEntry(13 + (team == ALLIANCE ? 0 : 14)); break; case RANK_14: Killer->SetTitle(sCharTitlesStore.LookupEntry(14 + (team == ALLIANCE ? 0 : 14)); break; } } }; void AddSC_PVPTitles() { new PVPTitles(); }
  • 相关阅读:
    LeetCode 79. 单词搜索
    LeetCode 1143. 最长公共子序列
    LeetCode 55. 跳跃游戏
    LeetCode 48. 旋转图像
    LeetCode 93. 复原 IP 地址
    LeetCode 456. 132模式
    LeetCode 341. 扁平化嵌套列表迭代器
    LeetCode 73. 矩阵置零
    LeetCode 47. 全排列 II
    LeetCode 46. 全排列
  • 原文地址:https://www.cnblogs.com/needly/p/3752746.html
Copyright © 2011-2022 走看看