[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
帮 大一学弟 AC一道题
❥题面
❥思路
每个格子都可以作为开始节点，遍历找到最大数，可以直接用优先队列去模拟，或者用dfs+回溯
❥代码
#include <iostream> #include <cstdio> #include <algorithm> #include <queue>
using namespace std; struct Node { int val,zx,zy; bool operator<(const Node&e)
const{return val < e.val;} }; int answer; int main() { int number,time;
cin>>number>>time; priority_queue<Node> ok; for(int i=1; i<=number; i++) {
for(int j=1; j<=number; j++) { int val; cin>>val; ok.push({val,i,j}); } } int
tmpx=1, tmpy=1; while(time && ok.size()) { Node cur = ok.top(); ok.pop(); int
val = cur.val, zx=cur.zx, zy=cur.zy; int get_need = abs(zx-tmpx) + abs(zy-tmpy)
+ val; if(get_need<=time) { answer += val; time -= get_need; tmpx=zx,tmpy=zy; }
else break; } cout<<answer; return 0; }
