百练 2000 Gold Coins

题目链接:http://bailian.openjudge.cn/practice/2000

# include <stdio.h>
int main()
{
	int n,i,j,t,sum;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)
			break;
		sum=1;t=2;i=1;
		while(i!=n)
		{	
			for(j=0;j<t;j++)
			{
				sum=sum+t;
				i++;
				if(i==n)
					break;
			}
			t++;
		}
		printf("%d %d\n",n,sum);
	}
	return 0;
}


【EI复现】基于深度强化学习的微能源网能量管理与优化策略研究(Python代码实现)内容概要:本文围绕“基于深度强化学习的微能源网能量管理与优化策略”展开研究,重点利用深度Q网络(DQN)等深度强化学习算法对微能源网中的能量调度进行建模与优化,旨在应对可再生能源出力波动、负荷变化及运行成本等问题。文中结合Python代码实现,构建了包含光伏、储能、负荷等元素的微能源网模型,通过强化学习智能体动态决策能量分配策略,实现经济性、稳定性和能效的多重优化目标,并可能与其他优化算法进行对比分析以验证有效性。研究属于电力系统与人工智能交叉领域,具有较强的工程应用背景和学术参考价值。; 适合人群:具备一定Python编程基础和机器学习基础知识,从事电力系统、能源互联网、智能优化等相关方向的研究生、科研人员及工程技术人员。; 使用场景及目标:①学习如何将深度强化学习应用于微能源网的能量管理;②掌握DQN等算法在实际能源系统调度中的建模与实现方法;③为相关课题研究或项目开发提供代码参考和技术思路。; 阅读建议:建议读者结合提供的Python代码进行实践操作,理解环境建模、状态空间、动作空间及奖励函数的设计逻辑,同时可扩展学习其他强化学习算法在能源系统中的应用。
A. 纪念品 (Souvenir) A C D E F G H 传统题 1000ms 256MiB Description Xiaowei suddenly acquires a superpower. He knows the daily prices of N N souvenirs for the next T T days. The price of a souvenir refers to the number of gold coins required to buy the souvenir or the number of gold coins that can be earned by selling a souvenir. Every day, Xiaowei can carry out the following two types of transactions any number of times: Choose a souvenir. If he has enough gold coins with him, buy the souvenir at its price for that day. Sell any souvenir he has and earn gold coins equal to the price of the souvenir for that day. The gold coins earned by selling souvenirs on a day can be used to buy souvenirs on the same day too. Similarly, souvenirs purchased on a day can also be sold for gold coins on the same day. After T T days, Xiaowei’s superpower will disappear. Therefore, he will sell all the souvenirs he still has on the T T-th day. Currently, Xiaowei has M M gold coins, and he wants to have as many gold coins as possible after the superpower disappears. What is the maximum number of gold coins he can have? Input Format The first line contains three positive integers T T, N N and M M - the number of days for which Xiaowei knows souvenir prices, the number of souvenirs, and the number of gold coins that Xiaowei currenly has. i i-th of the next T T lines contains N N positive integers P i , 1 , P i , 2 , . . . , P i , N , P i,1 ​ ,P i,2 ​ ,...,P i,N ​ , where P i , j P i,j ​ denotes the price of the j j-th souvenir on the i i-th day. Output Format Print one line containing a positive integer denoting the maximum number of gold coins Xiaowei can have after his superpower disappears. 输入数据 1 6 1 100 50 20 25 20 25 50 输出数据 1 305 The best strategy is: On the second day, spend all 100 100 gold coins to buy 5 5 units of souvenir 1 1. Sell all the 5 5 units of souvenir 1 1 on the third day and get 125 125 gold coins. Buy 6 6 units of souvenir 1 1 on the fourth day. 5 5 gold coins are left. On the sixth day, sell all souvenirs for 300 300 gold coins. On the fourth day there were 5 5 gold coins remaining, so now there are 305 305 gold coins remaining. After the superpower disappears, Xiaowei has 305 305 gold coins, which is the maximum possible. 输入数据 2 3 3 100 10 20 15 15 17 13 15 25 16 输出数据 2 217 The best strategy is: On the first day, spend all the gold coins to buy 10 10 units of souvenir 1 1. Sell all the units of souvenir 1 1 on the next day and get 150 150 gold coins. Buy 8 8 units of souvenir 2 2 and 1 1 unit of souvenir 3 3. 1 1 gold coin is remaining. On the third day, sell all souvenirs and get 216 216 gold coins. On the second day, there was 1 1 gold coin left, so in total there are 217 217 gold coins left. After the superpower disappears, Xiaowei has 217 217 gold coins, which is the maximum possible. Constraints For 10 % 10% of the data, T = 1 T=1. For 30 % 30% of the data, T ≤ 4 , N ≤ 4 , M ≤ 100 , 10 ≤ P i , j ≤ 1001 T≤4,N≤4,M≤100,10≤P i,j ​ ≤1001. For another 15 % 15% of the data, T ≤ 100 , N = 1 T≤100,N=1. For another 15 % 15% of the data, T = 2 , N ≤ 100 T=2,N≤100. For 100 % 100% of the data, T ≤ 100 , N ≤ 100 , M ≤ 10 3 , 1 ≤ P i , j ≤ 10 4 T≤100,N≤100,M≤10 3 ,1≤P i,j ​ ≤10 4 . It is guaranteed that at any time, the number of gold coins that Xiaowei has can't exceed 10 4 10 4 .
10-27
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值