Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
227808 | 232214陈皓轩 | 提高:贪心:数列极差 | C++ | Wrong Answer | 0 | 0 MS | 276 KB | 422 | 2023-12-31 14:06:57 |
#include <iostream> #include <vector> #include <algorithm> #define int long long using namespace std; vector<int> a; signed main() { int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; a.push_back(x); } sort(a.begin(), a.end()); int ma(a[0]), mi(a[n - 1]); for (int i = 1; i < n; i++) ma = ma * a[i] + 1; for (int i = n - 2; i >= 0; i--) mi = mi * a[i] + 1; cout << ma - mi; }