wode的专栏

#include #include #include #include #include #include #include #define N 160using namespace std;int n;int ma[N][N];void print2(int ma[][N],int n){ for(int i=1; i<=n; i++) {

#include#include#include#include#include#include#include #define N 10000#define M 1000001using namespace std;int a[N];int num[M];int n;int main(){// freopen("ex.in","r",stdin);

描述: 我们把序列排成不增序，即d1>=d2>=...>=dn，则d可简单图化当且仅当d'=(d2-1, d3-1, ... d(d1+1)-1, d(d1+2), d(d1+3), ... dn)可简单图化。这个定理写起来麻烦，实际上就是说，我们把d排序以后，找出度最大的点(设度为d1)，把它和度次大的d1个点之间连边，然后这个点就可以不管了，一直继续这个过程，直到建出完整的图，或出现负度等明显

#include#include#include#include#include#include#include #include#include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 10005using namespace std;

题意：农场有n头奶牛，每头奶牛都有一个产奶周期ti天（ti#include#include#include#include#include#include #include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 1005using na

#include#include#include#include#include#include#include #define N 60#define MIN 1e-11#define M 32010#define MM 70000using namespace std;int n,t;char a[N][100];int strcmpp(char a[],char