【网易笔试】100 100 100 0

先实现`a <= b <= c` 然后 if ((a+b)*2 >= c)   cout << ((a+b+c)/3 + (a+b+c)%3) << '\n'; else {   cout << (c/2 + c%2) << '\n'; }

第三题： int main() {     int T;     cin >> T;     while (T--) {         int n, k;         cin >> n >> k;         vector<int> a(n);         for (int i = 0; i < n; i++)             cin >> a[i];         vector<int> dp(n, 0);         dp[n - 1] = -1;         for (int i = n - 2; i >= 0; i--) {             for (int j = min(n - 1, i + k); j > i; j--) {                 if (a[j] <= a[i] && dp[j] == -1) {                     dp[i] = -1;                     break;                 }             }         }         if (dp[0] == -1) {             cout << "YES" << endl;             continue;         }         for (int i = 0; i < n; i++)             cout << dp[i] << ' ';         cout << endl;         bool res = false;         dp[0] = 1;         for (int i = 1; i < n; i++) {             for (int j = max(0, i - k); j < i; j++) {                 if (dp[j] == 1) {                     if (dp[i] == -1) {                         res = true;                         break;                     }                     else if (a[j] >= a[i])                         dp[i] = 1;                 }             }             if (res == true)                 break;         }         if (res)             cout << "YES" << endl;         else             cout << "NO" << endl;     }     system("pause");     return 0; }

第二题一样思路，我一直10%。。。脑阔疼😪 100 10 100 90

吃葡萄 求个代码叻

求吃葡萄代码

我…我以为只能从每一堆中拿一块积木，原来可以重复拿的！？

最后一题通过了10%，最后改成long long没提交成功。

你们做了问答题吗？那个怎么判分啊？

第一题： int main() {     int T;     cin >> T;     while (T--) {         vector<int> a(3);         cin >> a[0] >> a[1] >> a[2];         sort(a.begin(), a.end());         if ((a[0] + a[1]) >= a[2] / 2) {             long long sum = a[0] + a[1] + a[2];             if (sum % 3 == 0)                 cout << sum / 3 << endl;             else                 cout << sum / 3 + 1 << endl;         }         else {             if (a[2] % 2 == 0)                 cout << a[2] / 2 << endl;             else                 cout << a[2] / 2 + 1 << endl;         }     }     system("pause");     return 0; }

第二题： int main() {     int T;     cin >> T;     while (T--) {         int n, m;         cin >> n >> m;         long long sum = m;         int temp;         int i = 0;         long long tar = n * (n - 1) / 2;         bool flag = true;         for (; i < n; i++) {             cin >> temp;             sum = sum + temp - i;             if (sum < 0) {                 flag = false;             }         }         if (flag)             cout << "YES" << endl;         else             cout << "NO" << endl;     }     return 0; }