⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 1349.cpp

📁 这是哈尔滨工业大学acmOJ的源代码
💻 CPP
字号:
/*  This Code is Submitted by wywcgs for Problem 1349 on 2005-03-25 at 15:28:29 */ 
#include <stdio.h>

int main()
{
    int n, h, t[25], lakef[25], laked[25], maxFish, laket[25];
    int i, j, k = 0;
    int tlakef[25], a, lakeNum, fishNum, c, tlaket[25];
    
    while(scanf("%d", &n) == 1){
        if(n == 0){
            return 0;
        }else{
            scanf("%d", &h);
            h *= 60;
            for(i = 0; i < n; i++){
                scanf("%d", &lakef[i]);
            }
            for(i = 0; i < n; i++){
                scanf("%d", &laked[i]);
            }    
            for(i = 0; i < n-1; i++){
                scanf("%d", &t[i]);
                t[i] *= 5;
                if(i > 0){
                    t[i] += t[i-1];
                }
            }
            if(k != 0){
                printf("\n");
            }
            k++;
            maxFish = -1;
            for(i = 0; i < n; i++){
                fishNum = 0;
                if(i == 0){
                    a = h;
                }else{
                    a = h - t[i-1];
                }    
                for(j = 0; j < n; j++){
                    tlakef[j] = lakef[j];
                    tlaket[j] = 0;
                }
                for(; a > 0; a -= 5){
                    c = -1;
                    for(j = 0; j <= i; j++){
                        if(c < tlakef[j]){
                            c = tlakef[j];
                            lakeNum = j;
                        }
                    }
                    if(c <= 0){
                        tlaket[0] += 5;
                    }else{
                        tlaket[lakeNum] += 5;
                        fishNum += tlakef[lakeNum];
                        tlakef[lakeNum] -= laked[lakeNum];
                    }
                }
                if(fishNum > maxFish){
                    maxFish = fishNum;
                    for(j = 0; j < n; j++){
                        laket[j] = tlaket[j];
                    }
                }
            }
            for(i = 0; i < n; i++){
                printf("%d", laket[i]);
                if(i != n-1){
                    printf(", ");
                }
            }
            printf("\n");
            printf("Number of fish expected: %d\n", maxFish);
        }
    }
    
    return 0;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -