niklasjang

#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

int n,l,p;
int map[50][50];
int region[50][50];
int comp[2501]; // comp[i] : i번째 dfs의 연결요소 갯수
int people[2501]; //people[i] : i번째 dfs의 총 사람 수

niklasjang

#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;

int n = 0;
int map[20][20];
int pointSum = 0;

niklasjang

#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;

int map[20][20];
int dmap[20][20];
bool visited[20][20];

niklasjang

#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
using namespace std;

int n, m, k;
vector<int> map[10][10];
bool visited[10][10];
int poo[10][10];

niklasjang

//12시 49분 시작

#include <iostream>
#include <vector>
using namespace std;

struct shark{
	int r,c,s,d,z;
	shark(){
		r = c = s = d = z = 0;

niklasjang

#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;

int r = 0, c = 0, k = 0;
int map[201][201];
int cnt[101];
int w =3, h = 3;

niklasjang

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

class HORSE {
public:
	int pos;
	HORSE() {
		pos = 0;

niklasjang

#include <iostream>
#include <algorithm>
using namespace std;

int n,m,t;
int card[500000];
int s, e, mid;
int maxRight, minLeft;

int main(void) {

niklasjang

#include <iostream>
#include <algorithm>
using namespace std;

int n,m,t;
int card[500000];
int s, e, mid;
bool search(int x) {
	
	return false;

niklasjang

#include <iostream>
using namespace std;

int n;
int spd[300000];
int main(void) { 
	cin >> n;
	int i = 0;
	for (i = 0; i < n; i++) {
		cin >> spd[i];