acwing::acwing1913类 参考

AcWing 1913. 公平摄影 更多...

#include <acwing.h>

静态 Public 成员函数
static int	main (istream &cin, ostream &cout)

详细描述

AcWing 1913. 公平摄影

在文件 acwing.h 第 662 行定义.

成员函数说明

main()

int acwing::acwing1913::main ( istream &  cin, ostream &  cout  )

static

在文件 acwing.cpp 第 1806 行定义.

                                                    {
        unsigned int n;
        cin >> n;
        auto cows    = map<unsigned int, int>();
        auto indexes = vector<unsigned int>();
        auto sum     = unordered_map<int, set<unsigned int>>();
        for(unsigned int i = 0; i < n; i++) {
            unsigned int x;
            char b;
            cin >> x >> b;
            indexes.push_back(x);
            if(b == 'G') {
                cows.insert(pair(x, 1));
            } else {
                cows.insert(pair(x, -1));
            }
        }
        sort(indexes.begin(), indexes.end());
 
        unsigned int g_count = 0;
        unsigned int h_count = 0;
        unsigned int g_max   = 0;
        unsigned int h_max   = 0;
        int g_start          = -1;
        int h_start          = -1;
        int count            = 0;
        for(auto &cow: cows) {
            if(cow.second == 1) {
                //G
                h_count = 0;
                h_start = -1;
                if(g_start == -1) {
                    g_start = cow.first;
                } else {
                    g_count = cow.first - g_start;
                }
                g_max = max(g_max, g_count);
            } else {
                //H
                g_count = 0;
                g_start = -1;
                if(h_start == -1) {
                    h_start = cow.first;
                } else {
                    h_count = cow.first - h_start;
                }
                h_max = max(h_max, h_count);
            }
            count += cow.second;
            cow.second = count;
            if(!sum.contains(cow.second)) {
                auto s = set<unsigned int>();
                s.insert(cow.first);
                sum.insert(pair(cow.second, s));
            } else {
                sum[cow.second].insert(cow.first);
            }
        }
        unsigned int maximum = 0;
        for(const auto &i: sum) {
            if(i.first == 0) {
                maximum = max(maximum, *i.second.rbegin() - indexes[0]);
            } else if(i.second.size() >= 2) {
                maximum = max(maximum, *i.second.rbegin() - *upper_bound(indexes.begin(), indexes.end(), *i.second.begin()));
            }
        }
        cout << max(maximum, max(g_max, h_max));
        return 0;
    }

被这些函数引用 acwing::TEST().

---

该类的文档由以下文件生成:

• acwing.h
• acwing.cpp