【远景+顺丰科技笔试】远景100 100 顺丰 100 64

同样是暴力dp为什么我27%就超时了😭

大佬是怎么做到两套题都做的

顺丰第一题： int main() {     int n, m, k;     cin >> n >> m >> k;     vector<vector<int>> peo(n + 1);     vector<vector<int>> lan(m + 1);     for (int i = 0; i < k; i++) {         int a, b;         cin >> a >> b;         peo[a].push_back(b);         lan[b].push_back(a);     }     vector<bool> flag(n + 1, false);     int res = 0;     for (int i = 1; i <= n; i++) {         if (flag[i] == false) {             res++;             queue<int> q;             q.push(i);             flag[i] = true;             while (!q.empty()) {                 int cur = q.front();                 q.pop();                 for (int i = 0; i < peo[cur].size(); i++) {                     for (int j = 0; j < lan[peo[cur][i]].size(); j++) {                         if (flag[lan[peo[cur][i]][j]] == false) {                             q.push(lan[peo[cur][i]][j]);                             flag[lan[peo[cur][i]][j]] = true;                         }                     }                 }             }         }     }     if (k == 0)         cout << res << endl;     else         cout << res - 1 << endl;     system("pause");     return 0; }

求远景代码，很简单但是a不了😂

佬中佬  两个居然能一起

100 100 27 91

也是一起做的，100,100,18,100， 18随便做的😂，没看懂题要干啥

大佬可以贴下题目吗

老哥真猛啊，我也是一起做的，100，100，0，64😂，看到最长递增子序列以为很简单，然后卡住了……这题tm还是非严格递增

巨佬，你是两个笔试一起做的吗？？？

TQL，大佬

顺丰第二题： int main() {     int n;     cin >> n;     vector<int> a(n);     for (int i = 0; i < n; i++)         cin >> a[i];     vector<int> dp(n, 1);     for (int i = 0; i < n; i++) {         for (int j = i - 1; j >= 0; j--) {             if (dp[i] >= j + 2)                 break;             if (a[i] >= a[j])                 dp[i] = max(dp[i], dp[j] + 1);         }     }     cout << dp[n - 1] << endl;     system("pause");     return 0; }