No commit message

Lib/SegmentTree/fenwickTree.cpp

@@ -2,7 +2,63 @@
 
 using namespace std;
 
-//1-index的树去movieCollection_UVA1513.cpp查看
+class fenwickTree1index
+{
+    private:
+
+    int lowbit(int x)
+    {
+        return x & (-x);
+    }
+
+    public:
+
+    vector<int> a;
+    vector<int> s;
+
+    fenwickTree(vector<int> & in)
+    {
+        int n = in.size();
+
+        a.assign(n, 0);
+        s.assign(n, 0);
+
+        for (int i = 1; i <= n - 1; ++i)
+        {
+            update(i, in[i]);
+        }
+    }
+
+    void update(int k, int delta)
+    {
+        int n = s.size() - 1;
+
+        a[k] += delta;
+
+        for (int i = k; i <= n; i += lowbit(i))
+        {
+            s[i] += delta;
+        }
+    }
+
+    int query(int k)
+    {
+        int n = s.size() - 1;
+        int ans = 0;
+
+        for (int i = k; i >= 1; i -= lowbit(i))
+        {
+            ans += s[i];
+        }
+
+        return ans;
+    }
+
+    int sum(int i, int j)
+    {
+        return query(j) - query(i - 1);
+    }
+};
 
 class fenwickTree
 {

myCpps/!-OJcreater.cpp

@@ -12,7 +12,7 @@
 using namespace std;
 
 //***************************************
-const string CPPfile = "theSkylineProblem_UVA105"; //*
+const string CPPfile = "pingPong_UVA1428"; //*
 //***************************************
 
 ifstream fin(CPPfile + ".cpp");

myCpps/pingPong_UVA1428.cpp

@@ -0,0 +1,101 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+ifstream fin("pingPong_UVA1428.in");
+ofstream fout("pingPong_UVA1428.out");
+
+class fenwickTree
+{
+    private:
+
+    int lowbit(int x)
+    {
+        return x & (-x);
+    }
+
+    public:
+
+    vector<int> a;
+    vector<int> s;
+
+    fenwickTree(vector<int> & in)
+    {
+        int n = in.size();
+
+        a.assign(n, 0);
+        s.assign(n, 0);
+    }
+
+    void update(int k, int delta)
+    {
+        int n = s.size() - 1;
+
+        a[k] += delta;
+
+        for (int i = k; i <= n; i += lowbit(i))
+        {
+            s[i] += delta;
+        }
+    }
+
+    int query(int k)
+    {
+        int n = s.size() - 1;
+        int ans = 0;
+
+        for (int i = k; i >= 1; i -= lowbit(i))
+        {
+            ans += s[i];
+        }
+
+        return ans;
+    }
+
+    int sum(int i, int j)
+    {
+        return query(j) - query(i - 1);
+    }
+};
+
+
+int main()
+{
+    int testCase; fin >> testCase;
+    for (int t = 1; t <= testCase; ++t)
+    {
+        int n; fin >> n;
+
+        vector<int> s(100001, 0);
+        fenwickTree treeL(s), treeR(s);
+
+        vector<int> a(n, 0), l(n, 0), r(n, 0);
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            fin >> a[i];
+        }
+
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            treeL.update(a[i], 1);
+            l[i] = treeL.query(a[i]);
+        }
+
+        for (int i = n - 1; i >= 0; --i)
+        {
+            treeR.update(a[i], 1);
+            r[i] = treeR.query(a[i]);
+        }
+
+        long long ans = 0;
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            int minL = l[i] - 1, minR = r[i] - 1;
+            ans += (minL * (n - i - 1 - minR) + (i - minL) * minR);
+        } 
+
+        fout << ans << '\n';
+    }
+
+    return 0;
+}

myCpps/pingPong_UVA1428.in

@@ -0,0 +1,2 @@
+1
+3 1 2 3

myCpps/pingPong_UVA1428.out

@@ -0,0 +1 @@
+1

myCpps/pingPong_UVA1428OJ.cpp

@@ -0,0 +1,103 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+class fenwickTree
+{
+    private:
+
+    int lowbit(int x)
+    {
+        return x & (-x);
+    }
+
+    public:
+
+    vector<int> a;
+    vector<int> s;
+
+    fenwickTree(vector<int> & in)
+    {
+        int n = in.size();
+
+        a.assign(n, 0);
+        s.assign(n, 0);
+    }
+
+    void update(int k, int delta)
+    {
+        int n = s.size() - 1;
+
+        a[k] += delta;
+
+        for (int i = k; i <= n; i += lowbit(i))
+        {
+            s[i] += delta;
+        }
+    }
+
+    int query(int k)
+    {
+        int n = s.size() - 1;
+        int ans = 0;
+
+        for (int i = k; i >= 1; i -= lowbit(i))
+        {
+            ans += s[i];
+        }
+
+        return ans;
+    }
+
+    int sum(int i, int j)
+    {
+        return query(j) - query(i - 1);
+    }
+};
+
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	std::cin.tie(NULL);
+    int testCase; cin >> testCase;
+    for (int t = 1; t <= testCase; ++t)
+    {
+        int n; cin >> n;
+
+        vector<int> s(100001, 0);
+        fenwickTree treeL(s), treeR(s);
+
+        vector<int> a(n, 0), l(n, 0), r(n, 0);
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            cin >> a[i];
+        }
+
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            treeL.update(a[i], 1);
+            l[i] = treeL.query(a[i]);
+        }
+
+        for (int i = n - 1; i >= 0; --i)
+        {
+            treeR.update(a[i], 1);
+            r[i] = treeR.query(a[i]);
+        }
+
+        long long ans = 0;
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            int minL = l[i] - 1, minR = r[i] - 1;
+            ans += (minL * (n - i - 1 - minR) + (i - minL) * minR);
+        } 
+
+        cout << ans << '\n';
+    }
+
+   	cout.flush();
+   	return 0;
+}
+