迅雷

Author: zhunago

nowcoder/xunlei1.py

@@ -0,0 +1,25 @@
+import sys
+
+num = [int(elem) for elem in sys.stdin.readline().strip().split(",")]
+sumforward = [0 for i in range(len(num) + 1)]
+sumbackwad = [0 for i in range(len(num) + 1)]
+
+ss = 0
+
+
+for i in range(len(num)):
+    sumforward[i + 1] = sumforward[i] + num[i]
+i = len(num)
+while(i > 0):
+    sumbackwad[i-1] = sumbackwad[i] + num[i - 1]
+    i -=1
+
+hasresult = False
+for i in range(len(num)):
+    if(sumforward[i] == sumbackwad[i + 1]):
+        print(num[i])
+        hasresult = True
+        break
+
+if not hasresult:
+    print("False")

nowcoder/xunlei2.cpp

@@ -0,0 +1,76 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <queue>
+#include <sstream>
+
+using namespace std;
+
+int main(void)
+{
+    vector<int> a;
+    vector<int> b;
+    int temp;
+    char c;
+    while(cin >> temp)
+    {
+        a.push_back(temp);
+        cin >> c;
+        if(c == '-') break;
+    }
+    while(cin >> temp)
+    {
+        b.push_back(temp);
+        cin >> c;
+        if(c == ':') break;
+    }
+    int k;
+    cin >> k;
+
+    sort(a.begin(), a.end(), [](int ta, int tb){return ta > tb;});
+    sort(b.begin(), b.end(), [](int ta, int tb){return ta > tb;});
+
+    auto comp = [&](const vector<int>& a, const vector<int>& b) {
+        return a.back() < b.back();
+    };
+    typedef priority_queue<vector<int>, vector<vector<int>>, decltype(comp)> pq_t;
+    pq_t pq(comp);
+    for(int i = 0; i < b.size(); ++i)
+    {
+        pq.push({i, 0, b[i] + a[0]});
+    }
+
+    int count = 0;
+    stringstream ss;
+    while(!pq.empty())
+    {
+        const vector<int> &curMax = pq.top();
+        int ib = curMax[0];
+        int ia = curMax[1];
+        pq.pop();
+        int temp = 0;
+        int i = 0;
+        for(i = ia; i < a.size(); ++i)
+        {
+            temp = b[ib] + a[i];
+            if(temp >= pq.top()[2])
+            {
+                ss << temp << ',';
+                count += 1;
+                if(count == k)
+                {
+                    break;
+                }
+            }
+            else
+            {
+                pq.push({ib, i, temp});
+                break;
+            }
+        }
+        if(count == k) break;
+    }
+    string result = ss.str();
+    cout << result.substr(0, result.size() - 1) << endl;
+    return 0;
+}