whiskey_wei的博客

求图中任意两点的最短距离中的最大值； 开始时没读题意，wa； 需要注意用map处理字符串的方法； 由于bfs的特性，最短的路径肯定是最先找到； 人家的代码： #include #include #include #include #include #include #include #include #define inf 0x3f3f3f3f using namesp

Problem Description Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW. If