厦门饮冰信竞

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; int W=0,H=0; //h为有几列 int a[101][101] = {0}; int f[101][101] = {0}; //用来存量 int g[101][101] = {0}; //用来占位 int.

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; int n=0; int a[101] = {0}; int bf[101]; int cf[101]; int maxx=0; int main() { //输入数据 cin >> n; for(i.

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; const int N=4; int a[N+1][N+1]={ {0,0,0,0,0}, {0,0,-2,-7,0}, {0,9,2,-6,2}, {0,-4,1,-4,1}, {0,-1,8,0,-2} }.

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; int n=0; int a[101]={0}; int f[101]; //存量效应 int main() { //输入数据 cin >> n; for(int i=1;i<=n;.