Hdoj 1205 eating Sweets (math)

"Thinking": The act of eating sugar as a 22 elimination of behavior, so if you want to eliminate all, depending on the number of the most. So the formula: Max-(Sum-max) <= 1. In addition: to adopt the Longlong type.

"AC Code":

#include <iostream> #include <cstdlib> #include <cstdio> #include <cstring> #include < Algorithm> #include <iomanip>using namespace std; #define MAX 1000000+10int Num[max];int Main () {    //freopen ("In.txt", "R", stdin);    int T = 0;    Cin >> T;    while (t--)    {        int i = 0;        A long long int N = 0, sum = 0, Mmax = 0;        Cin >> N;        for (i = 0; i < N; i++)        {            scanf ("%d", &num[i]);            Sum + = Num[i];            if (Num[i] > Mmax)                mmax = Num[i];        }        if (mmax-1 <= sum-mmax)            cout << "Yes" << Endl;        else            cout << "No" << Endl;    }    return 0;}

Hdoj 1205 eating Sweets (math)