题意 AraBellaC Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 277    Accepted Submission(s): 100 Problem Description Princess Arabella loves the letter `C`, which earned her the epithet `ArraBell…

A - Age of Moyu 题意:给出一张图,从1走到n,如果相邻两次走的边的权值不同,花费+1, 否则花费相同,求最小花费 思路:用set记录有当前点的最小花费有多少种方案到达,然后最短路 #include<bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; ; struct Edge{ int to, nxt, val; Edge(){} Edge(int to, int nxt, int val):to(to…