题解：P2911 [USACO08OCT] Bovine Bones G

Luoyinzhao · 2025-05-29 19:56:20 · 题解

# 骆驼的第一次题解

希望大家能喜欢

#include<bits/stdc++.h>
using namespace std;
int main(){
    int s1, s2, s3;  
    cin >> s1 >> s2 >> s3; 
    vector<int> count(s1 + s2 + s3 + 1, 0); 
    for (int i = 1; i <= s1; i++) { 
        for (int j = 1; j <= s2; j++) { 
            for (int k = 1; k <= s3; k++) { 
                int sum = i + j + k; 
                count[sum]++; 
            } 
        } 
    } 

    int maxCount = 0; 
    int result = 0; 
    for (int i = 3; i <= s1 + s2 + s3; i++) { 
        if (count[i] > maxCount) { 
            maxCount = count[i]; 
            result = i; 
        } 
    } 
    cout<<result; 
    return 0;
}

作者声明：误抄