chaomaer的博客

#include <iostream>#include <cstdio>#include <string>#include <sstream>#include <cstring>using names

#include <iostream>#include <string.h>using namespace std;int min(int x,int y){ return x>y?y:x;}int m, n;const int size = 101;const int INF = 0x3f3f3f3f;int road[size][s

#include <iostream>#include <map>#include <string.h>#include <string>using namespace std;const int size = 31;int n;map<string, int> str2ix;

#include <iostream>#include <math.h>#include <string.h>#include <stdio.h>#include &l

#include <iostream>#include <algorithm>#include <vector>#include <map>#include <string>#include <queue>#include <cstring>#include <cstdio&gt

Thinking in topological sorthow to judge if has a loopwhen there are still some unvisited node, but the number of node whose in-degree==0 equals zero, we can say: there is a loop in the graph.ho...

#include<stdio.h>#include<iostream>#include<algorithm>#include<functional>#include<vector>#include<string.h>using namespace std;vector<int> vect1;vect

很好的思路，同时从前面和后面计算最大的连续序列和，然后遍历中间点，得出最大值。#include<stdio.h>#include<iostream>#include<algorithm>#include<functional>#include<vector>#include<string.h>using nam...

自己对于这道题目的理解 主要参考的代码链接 传送门BEGIN LOOP n OP 4 LOOP 3 LOOP n OP 1 END OP 2 END OP 1 END OP 17 OP 17 LOOP n OP 4 LOOP 3 LOOP n ...