MRT Map
题意
按序号给出n个城市名称,再给出m条关系给出两个城市序号,城市之间的距离由两个城市的名称的相同字母数决定(不分大小写,每个字母最多算一次)。最后给出两个城市编号输出这两个城市之间的最短路径长度。
思路
主要问题是求距离,其他就是模板。记录两城市名称中出现过哪些字母即可。
#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
const int N = 1e4 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
typedef pair<int, int> PII;
typedef long long ll;
int n;
//无向图大小要开边的两倍
int h[M], w[M], e[M], ne[M], idx;
int dist[N];
bool vis[N];
void add(int a, int b, int c) {
e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx;
idx++;
}
typedef pair<int, int> PII;
void dijkstra(int k)
{
memset(dist, 0x3f, sizeof dist);
dist[k] = 0;
priority_queue<PII, vector<PII>, greater<PII>> heap;
heap.push({ 0, k });
while (heap.size())
{
auto t = heap.top();
heap.pop();
int ver = t.second, distance = t.first;
if (vis[ver]) continue;
vis[ver] = true;
for (int i = h[ver]; i != -1; i = ne[i])
{
int j = e[i];
if (dist[j] > distance + w[i])
{
dist[j] = distance + w[i];
heap.push({ dist[j], j });
}
}
}
}
unordered_map<int, string> p;
int getdis(string u, string v) {
int cnt = 0;
bool a[27], b[27];
memset(a, 0, sizeof a);
memset(b, 0, sizeof b);
int len1 = u.size();
int len2 = v.size();
for (int i = 0; i < len1; i++) {
if (u[i] >= 'a' && u[i] <= 'z') {
a[u[i] - 'a'] = true;
}
else if (u[i] >= 'A' && u[i] <= 'Z') {
a[u[i] - 'A'] = true;
}
}
for (int i = 0; i < len2; i++) {
if (v[i] >= 'a' && v[i] <= 'z') {
b[v[i] - 'a'] = true;
}
else if (v[i] >= 'A' && v[i] <= 'Z') {
b[v[i] - 'A'] = true;
}
}
for (int i = 0; i < 26; i++) {
if (a[i] && b[i]) cnt++;
}
return cnt;
}
int main()
{
off;
int m;
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
p[i] = s;
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
int w = 0;
w = getdis(p[u], p[v]);
add(u, v, w);
add(v, u, w);
}
int s, t;
cin >> s >> t;
dijkstra(s);
cout << dist[t] << endl;
return 0;
}
Give Me This Pizza
题意
输出序列中每个数右边第一个比自身大的数,没有输出-1
思路
单调栈,从右往左遍历即可。每次将小于当前数的元素出栈。因为栈顶元素在原序列中在当前数的右边,此时不可能作为其他数的第一个最大值。
#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
const int N = 1e5 + 10;
const int M = 2e7 + 10;
const int mod = 1e9 + 7;
typedef pair<int, int> PII;
typedef long long ll;
int a[N];
int main()
{
off;
int n;
cin >> n;
stack<int> s;
stack<int> ans;
forn(i, n)cin >> a[i];
for (int i = n - 1; i >= 0; i--){
while (!s.empty() && s.top() <= a[i]) s.pop();
if (!s.empty()) ans.push(s.top());
else ans.push(-1);
s.push(a[i]);
}
while (!ans.empty()) {
cout << ans.top() << ' ';
ans.pop();
}
return 0;
}