NIT,Problem2 Elephant
http://acm.nit.net.cn/showproblem.jsp?pid=1002不知道为什么总是WA，测试没遇到问题。把代码贴在这里
#include <stdio.h>#define TOTAL 1000int w;int s;int a;int b;int c;int layer;void swap(int *, int *);void sort(int []);int findList();void pf(int);int main(){int i, n;scanf("%d",&n);for(i=0; i< n; i++){scanf("%d%d",&w, &s);}sort(w);n=findList();printf("%d\n", n);for(i = (int)TOTAL -1; i >= 0; i--){if(layer == n){pf(i);break;}}return 0;}void sort(int t[]){int i,j;a=1;for(i=1; i < TOTAL && t != 0; i++){a=i+1;for(j=i; j >= 0; j--){if(t < t){swap(&t, &t);swap(&s, &s);swap(&a, &a);}}}}void swap(int * a, int * b){int temp = *a;*a = *b;*b = temp;}int findList(){int i, j;int k=0;int temp = 0;b = 1;c = 0;layer = 1;for(i=1; i < TOTAL && s != 0; i++){b = 1;c = i;layer = 1;k=i;for(j=0; j<i; j++){if(s < s && b >= b && w != w){b = b + 1;k = j;}}c = k;if(k != i)layer = layer + 1;if(temp < b)temp = b;}return temp==0 ? 1: temp;}void pf(int i){if(layer == 1){printf("%d\n", a);return;}pf(c);printf("%d\n", a);}
页:
[1]