9.6 美团笔试编程题

A
题意: 求一棵树中, 从点1遍历所有点的最短距离, 所有相邻点之间的距离都是1
思路: 假设问题是这样, 从点1遍历所有点最后回到点1, 很显然对于结果就是2 * (n - 1), 因为每条边都会遍历恰好两次, n是结点数目. 那么此时只需要遍历所有点, 不需要回到点1, 那么我们可以选择一条从1出发的最长路径, 这条路径中的边只会遍历一次. 答案就是 2 * (n - 1) - 从点1出发的最长路径长度.

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
// #include <unistd.h>
#include <unordered_map>

using namespace std;

#define LL long long
#define pb push_back
#define mk make_pair
#define pill pair<int, int>
#define fi first
#define se second
#define mst(a, b) memset(a, b, sizeof a)
#define lson (rt << 1)
#define rson ((rt << 1) | 1)

const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
const int MOD = 1e9 + 7;
vector<int> vt[qq];
int dep[qq];
int n, ans, node;

void dfs(int u, int fa) {
    if (u == 1) dep[u] = 0;
    else    dep[u] = dep[fa] + 1;
    int sz = vt[u].size();
    for (int i = 0; i < sz; ++i) {
        int v = vt[u][i];
        if (v == fa)    continue;
        dfs(v, u);
    }
}

int main() {
//  freopen("in.txt", "r", stdin);
    scanf("%d", &n);
    for (int i = 1, a, b; i < n; ++i) {
        scanf("%d%d", &a, &b);
        vt[a].pb(b), vt[b].pb(a);
    }
    dfs(1, 0);
    int ans = 2 * (n - 1);
    int maxn = -1;
    for (int i = 1; i <= n; ++i) {
        maxn = max(maxn, dep[i]);
    }
    printf("%d\n", ans - maxn);
    return 0;
}

B
题意: 求所有长度为k区间中, 有多少区间中某个数字出现大于等于t次
思路: 滑动窗口维护区间中数字出现大于等于t次的个数

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
// #include <unistd.h>
#include <unordered_map>

using namespace std;

#define LL long long
#define pb push_back
#define mk make_pair
#define pill pair<int, int>
#define fi first
#define se second
#define mst(a, b) memset(a, b, sizeof a)
#define lson (rt << 1)
#define rson ((rt << 1) | 1)

const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
const int MOD = 1e9 + 7;
int n, k, t;
int num[qq], ct[qq];

int main() {
    scanf("%d%d%d", &n, &k, &t);
    if (k > n || t > n) {
        printf("0\n");
        return 0;
    }
    for (int i = 0; i < n; ++i) {
        scanf("%d", num + i);
    }
    int cnt = 0;
    for (int i = 0; i < k - 1; ++i) {
        ct[num[i]]++;
        if (ct[num[i]] >= t && ct[num[i]] - 1 < t)  cnt++;
    }
    int ans = 0;
    for (int i = k - 1; i < n; ++i) {
        ct[num[i]]++;
        if (ct[num[i]] >= t && ct[num[i]] - 1 < t)  cnt++;
        if (cnt > 0)    ans++;
        ct[num[i - k + 1]]--;
        if (ct[num[i - k + 1]] < t && ct[num[i - k + 1]] + 1 >= t)  cnt--;
    }
    printf("%d\n", ans);
    return 0;
}