1 条题解

  • 0
    @ 2026-7-11 16:40:49
    #include <iostream>
    #include <string.h>
    #include <cstdio>
    #include <algorithm>
    #include <string>
    #include <iomanip>
    #include <math.h>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <vector>
    #include <unordered_set>
    #include <unordered_map>
    using namespace std;
    const int N = 1e5 + 10;
    const int INF = 0x3f3f3f3f;
    
    int main(){
        
        freopen("game.in","r",stdin);
        freopen("game.out","w",stdout);
        
        int n; 
        cin >> n;
        
        string pre, cur;
        cin >> pre;
        long long total = 1;
        int score = 1;
        
      
        for (int i = 2; i <= n; i++){
            cin >> cur;
            if(cur == pre)
                score++; 
            else
                score = 1;
            total += score;
            pre = cur;
        }
        
        cout << total;
    
        return 0;
    }
    
    
    

    王超伟写题给我写好了呀!

    • 1

    信息

    ID
    3569
    时间
    1000ms
    内存
    256MiB
    难度
    5
    标签
    递交数
    112
    已通过
    45
    上传者