Online Judge【CodeForces】[658A]Bear and Reverse Radewoosh问题描述 问题分析根据题意分别计算两人的分值进行比较就好了 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 #include<stdio.h> int main() { int n,c; while(scanf("%d %d",&n,&c)!=EOF) { int a[55],q[55]; for(int i=0; i<n; i++) scanf("%d",&a[i]); for(int i=0; i<n; i++) scanf("%d",&q[i]); int sum1=0,sum2=0; int tq=0; for(int i=0; i<n; i++) { tq+=q[i]; int t=a[i]-c*tq; if(t>0) sum1+=t; } tq=0; for(int i=n-1; i>=0; i--) { tq+=q[i]; int t=a[i]-c*tq; if(t>0) sum2+=t; } if(sum1>sum2) printf("Limak\n"); else if(sum1<sum2) printf("Radewoosh\n"); else printf("Tie\n"); } return 0; }题目地址:【CodeForces】[658A]Bear and Reverse Radewoosh