X-man

摘要： View Code #include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[10001][101];//纸数组typedef struct Node{ int ik,ii;}mi;//最后一排有的连续空格bool cmp(Node a,Node b){ if(a.ik>b.ik) return true; return false;}int main(){ int N,L,M; int i,j; int res,k,ki,ans; while(... 阅读全文