随笔分类 - POJ
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 1005 #define inf 0x3f3f3f3f int data[maxn][maxn],n,dis[maxn],vis[maxn]; int Dij
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 100005 int par[2*maxn],height[2*maxn]; int Find(int x){ if(x==par[x])return x;
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 30005 int par[maxn],n,m,k[505],data[505][30005]; bool visit[maxn]; int findPar(
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 10005 int data[maxn],pre[maxn],root[maxn],visit[maxn]; int main(){ int cnt,i,p,
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int n,k,total,m; char ch[10][10]; bool book[10]; void dfs(int cur){ if(m==k){ total++; retur
阅读全文
摘要：#include<iostream> #include<queue> #include<cstring> using namespace std; #define maxn 105 int a,b,c; bool visit[maxn][maxn]; struct node{ int a,b,cnt
阅读全文
摘要：#include<iostream> #include<queue> #include<cstring> using namespace std; #define mn 35 int l,r,c,result; const int da[] = {1,-1,0,0,0,0},db[] = {0,0,
阅读全文
摘要：#include<iostream> #include<cstring> #include<vector> using namespace std; #define FLOOR 11 #define ROOM 11 #define AGENT 26 #define TIMELEN 9 #define
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int n,m,r,c,data[105][105],result; bool d[105][105]; bool test(){ for(int i=0;i<n;i++){ for(
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int main(){ int n; char data[70][20]; bool flag[70]; int w,s,num,start; memset(flag,false,si
阅读全文
摘要：#include<iostream> #include<cstring> #include<queue> using namespace std; struct Node{ int x,y; Node(){ x = 0; y = 0; } Node(int a,int b){ x = a; y =
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int n,d,x,y,num = 0; struct node{ int parent; int relation; }point[50005]; int find_par(int
阅读全文
摘要：#include<iostream> #include<algorithm> using namespace std; typedef struct node{ int x,y; }Point; Point point[5005]; int r,c,n; int qcmp(const void*a,
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> using namespace std; #define maxn 5005 typedef struct node{ int x,y; }Point; //int cmp(Point
阅读全文
摘要：#include<iostream> #include<cmath> using namespace std; int n,k; int data[10005]; bool check(int len){ int sum = 0; for(int i=0;i<n;i++){ sum += data[
阅读全文
摘要：#include<iostream> #include<cstring> #include<cmath> using namespace std; #define maxn 105 int r,c; int data[maxn][maxn],len[maxn][maxn]; const int dx
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; #define maxn 105 int m,n,w_num,path_num; typedef struct node{ int x1,y1,x2,y2; }Wall; Wall w
阅读全文
摘要：#include<iostream> //https://www.cnblogs.com/shihuajie/archive/2013/03/25/2980709.html using namespace std; long long pow(long long x,int y){ long lon
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int main(){ long long n; char s[100],out[100]; int t,i,j,k,len; scanf("%d",&t); while(t--){
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> using namespace std; int data[100],cnt,customer,total,now[5],end_item[5]; int now_type,end_ty
阅读全文
