力扣------经营摩天轮的最大利润

最新推荐文章于 2024-07-25 21:13:04 发布

qq_37760746

最新推荐文章于 2024-07-25 21:13:04 发布

阅读量120

点赞数

分类专栏： C/C++ 文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/qq_37760746/article/details/125614876

版权

C/C++ 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

在这里插入图片描述

int minOperationsMaxProfit(int* customers, int customersSize, int boardingCost, int runningCost){
    int Record=0;
    int top=0;
    int stack[1000000];
    int count=0;
    int max=-10000;
    int index;
    for(int a=0;a<customersSize;a++){
        Record=Record+customers[a];
        if(Record>4){
            count=count+4*boardingCost-runningCost;
            stack[top++]=count;
            Record=Record-4;
        }
        else{
            count=count+customers[a]*boardingCost-runningCost;
            stack[top++]=count;
            Record=0;            
        }
        if(stack[top-1]>max){
            max=stack[top-1];
            index=top-1;
            
        }
    }
    if(Record>0){
        while(1){
            if(Record>4){
                count=count+4*boardingCost-runningCost;
                stack[top++]=count;
                Record=Record-4;
            }
            else{
                count=count+Record*boardingCost-runningCost;
                stack[top++]=count;
                if(stack[top-1]>max){
                    max=stack[top-1];
                    index=top-1;
                }
                break;
            }
            if(stack[top-1]>max){
                max=stack[top-1];
                index=top-1;
            }
        }
    }
    if(max<=0){
        return -1;
    }
    return index+1;
}