알고리즘 문제 풀이/1DP_과제(~180615)
180217_2660_회장뽑기
//https://www.acmicpc.net/problem/2660 #include #include using namespace std;bool frd[51][51];bool visit[51];int score[51];int list[51];int n;int mn=51*51;int num; void input();int bfs(int people);void find();void init(); int main(){ input(); for(int i=1; i> n; int a=1, b=1; while(a!=-1 && b!=-1) { cin >> a >> b; frd[a][b]=frd[b][a]=1; }} int bfs(int people){ queue q; int tmp_cnt=1; int scr=-1; ..
