【CodeForces】[658A]Bear and Reverse Radewoosh

这里写图片描述

根据题意分别计算两人的分值
进行比较就好了

#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
");
        else if(sum1<sum2)
            printf("Radewoosh
");
        else
            printf("Tie
");
    }
    return 0;
}

题目地址:【CodeForces】[658A]Bear and Reverse Radewoosh

原文地址:https://www.cnblogs.com/BoilTask/p/12569596.html