P3045 [USACO12FEB] Cow Coupons G 题解

2021春 算法复习 [USACO12FEB]Cow Coupons G 贪心+堆。首先在优惠券没用完的情况下按优惠价从小到大全部买进。对于没购买的奶牛i,若想加购,可花费原价Pi,或挪用另一只奶牛j的优惠券,即花费Ci+Pj-Cj。故维护三个小根堆(P,C,P-C)即可。(代码略丑 #include<iostream> #include<algorithm> using namespace std; int n,k,n1,n2,n3,ans,a[50010],b[50010],h1[5001. 阅读详情

P3045 [USACO12FEB] Cow Coupons G

简化题意

有 N N N 头奶牛,第 i i i 头奶牛价格 P i P_i Pi​。 K K K 张优惠券,用优惠券购买第 i i i 头奶牛时价格为 C i C_i Ci​,每头奶牛只能用一次。不超过 M M M 的钱最多可以买多少?
1 ≤ K ≤ N ≤ 5 × 1 0 4 1 \le K \le N \le 5 \times 10^4 1≤K≤N≤5×104, 1 ≤ C i ≤ P i ≤ 1 0 9 1 \le C_i \le P_i \le 10^9 1≤Ci​≤Pi​≤109, 1 ≤ M ≤ 1 0 14 1 \le M \le 10^{14} 1≤M≤1014

思路

刚开始选最小的,但有时候不给最小的用优惠券,而是给后面用,可能更优。
所以我们加入反悔。
三个堆。原价,优惠,差价(本来选优惠,更改为选原价的差价)。都从小到大排。假设优惠券都用完了:如果此时选原价比优惠+差价便宜,就选原价。如果选优惠+差价优,就选优惠+差价,并且把这个的优惠的差价加入差价堆,代表也是可以反悔的。
我们可以在差价堆放 k k k 个 0 0 0,代表不用补差价,也就是 k k k 张优惠券。
选的时候注意标注哪些选过了。

启示:

贪心不一定是最优解,通过撤销(反悔)操作来获得最优解。(也就是反悔贪心啦

code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e4+5;
int n,k;
ll m;
struct node{
   ll c,p;
   int id;
}a[N];
struct node2{
   ll w;
   int id;
   bool operator < (const node2 &p) const{
   	return w>p.w;
   }	 
};
int vis[N];
priority_queue<node2> c,p;
priority_queue<int,vector<int>,greater<int> > dt;
int main(){
   scanf("%d%d%lld",&n,&k,&m);
   for(int i=1;i<=n;i++){
   	scanf("%lld%lld",&a[i].p,&a[i].c);
   	a[i].id=i;
   	c.push({a[i].c,i});
   	p.push({a[i].p,i});
   }
   ll nw=0;
   int cnt=0;
   for(int i=1;i<=k;i++) dt.push(0);
   while(!p.empty()&&!c.empty()){
   	node2 u1=c.top(),u2=p.top();
   	if(vis[u1.id]){
   		c.pop();
   		continue;
   	}
   	if(vis[u2.id]){
   		p.pop();
   		continue;
   	}
   	int d=dt.top(); 
   	if(u2.w<d+u1.w){
   		if(nw+u2.w>m) break;
   		vis[u2.id]=1;
   		nw+=u2.w;
   		cnt++;
   		p.pop();
   	}else{
   		if(nw+u1.w+d>m) break;
   		vis[u1.id]=1;
   		nw+=u1.w+d;
   		cnt++;
   		c.pop();
   		dt.pop();
   		dt.push(a[u1.id].p-a[u1.id].c);
   	}
   }
   printf("%d\n",cnt);
   return 0;
}
[USACO12FEB]牛券Cow Coupons 题目描述 Farmer John needs new cows! There are N cows for sale (1 <= N <= 50,000), and FJ has to spend no more than his budget of M units of money (1 <= M <= 10^14). Cow i costs P_i money (1 &... 阅读详情

相关推荐

PCB工艺-SI9000-模型选择

本文介绍了PCB设计中常用的阻抗计算模型,主要包括外层、内层和嵌入式三类共12种计算模型,涵盖单端/差分、共面等不同场景。针对阻抗计算中的关键参数,文章提供了经验值参考:表层走线厚度0.035mm(1.4mil),内层0.0152mm(0.6mil);并列出常见PP材料的介电常数(3.8-4.5)和成品厚度(3-7.5mil)。作者建议90%的设计问题可通过上述模型解决,层叠参数建议咨询PCB厂家获取。

weixin_50120208的博客 1396

P3045 [USACO12FEB]Cow Coupons G

P3045 [USACO12FEB]Cow Coupons G

zzzyyzz_的博客 259

OpenClaw与Ollama本地AI部署指南

AI模型本地化部署是当前企业数字化转型的关键技术,通过开源框架Ollama可以在消费级硬件上运行大语言模型。本文以OpenClaw多智能体系统为例,详解从环境配置到模型优化的全流程实践,特别针对国内开发者遇到的网络问题提供了镜像加速等解决方案。这种私有化部署方案尤其适合金融数据分析、企业知识管理等对数据安全要求高的场景,通过模块化设计实现多智能体协作,同时保持对NVIDIA显卡和普通CPU的兼容性。

weixin_34302561的博客 400

G: Cow Coupons

官方题解: There are several different ways to approach this problem. One of them stems from the initial idea of picking the lowest-cost cow each time: use all coupons on the cheapest cows, then buy as many cows as possible without coupons. However, this does.

zw201909250425的博客 297

【斯坦福计网CS144项目】环境配置 & Lab0: ByteStream

前言 感觉学了不少 C++ 编程的知识和技术但比较缺少实践,于是打算找一些项目跟着做一做。 首先安利一个自学网站 CS自学指南,北大的同学做的,汇总了很多国内外高校 CS 相关的高质量公开课,其中大部分是有课程项目的。翻了翻感觉 Stanford 的这门 CS144 计网课的 Lab 比较有趣,难度也不错,就是它了! 课程网址:CS 144: Introduction to Computer Networking 我跟的是 2021 Fall 学期的版本。 准备工作 在上面的网站中先把 8 个实验的文档(

アルタイル 8167

从量子兔AlphaPi硬件拆解到ESP32-C3库开发实战

本文详细拆解了量子兔AlphaPi开发板的硬件构成,重点分析了其核心ESP32-C3芯片及外围传感器。通过逆向工程揭示了GPIO引脚定义与通信协议,并实战演示了如何从零开发MicroPython库,驱动按键、加速度计及LED点阵,最终整合成一个互动平衡球游戏项目,展现了开源硬件在教育与二次开发中的潜力。

weixin_29164497的博客 464

P3045 [USACO12FEB] Cow Coupons G ( 反悔堆

如果补的差价+物品的优惠值 <= 直接再买一个(和前面的物品并不是同一个) 那就直接不用优惠卷买。比如你现在已经用了k张优惠卷,如果你想要用更换优惠卷,就用补差价,利用差值来表示更换优惠卷的操作。

m0_75125820的博客 190

DDD系列 - 第6讲 仓库Repository - Mybatis篇

书接上回,之前通过一个关于拆解、微服务、面向对象的故事,向大家介绍了如何从微服务、面向对象一步步演进到DDD的,整个演进过程如下图:其中在领域层,我们定义了富血模型的领域模型,包括聚合、聚合根、实体、值对象等。聚合在代码层面中的表现形式即是一个包Package,起到了边界的作用,聚合内的对象间高内聚,而聚合间低耦合。聚合中放着实体、值对象、仓库等,实体相较于值对象的一个典型区别就是实体存在唯一标识,并且可通过该唯一标识查询到该实体并对其进行相关操作,值对象不存在唯一标识且通常作为实体。

罗小爬的技术宝书 1789

洛谷P3045 [USACO12FEB] Cow Coupons G(堆,反悔贪心)

这里,每一个物品用优惠卷节省的钱可以使用优先队列。个最小的优惠假,再考虑如何反悔。表示一个已经使用了优惠卷的物品,表示一个未购买的物品。表示现在用了多少钱,如果要换成用原价购买。

weixin_74754298的博客 1015

Android开发工程师面试问题与参考答案

这是一份Android开发工程师职位面试指南,主要针对自研OS开发岗位。岗位要求3年以上独立开发经验,熟悉Android平台UI设计、四大组件和Java基础。面试问题覆盖五大核心领域:基础知识、开发经验、技术深度、问题解决和性能优化。文章提供了典型面试问题及专业参考答案,帮助应聘者准备关键技术点,如多线程处理、HashMap与ConcurrentHashMap区别、Handler机制等。同时建议应聘者结合项目经验展示优化能力,并注意公司提供完善的薪酬福利和团队文化。

郑伟强dev的专栏 896

stop pin/ignore pin/exclude pin/float pin

stop pin、ignore pin、exclude pin、float pin的区别

m0_61544122的博客 7300

洛谷P3045 [USACO12FEB]牛券Cow Coupons

题目:洛谷P3045 [USACO12FEB]牛券Cow Coupons 思路: 贪心 假设先用完所有优惠券,则只有两种决策:以原价购买未选物品中价格最低的;以最低代价退回当前用的一张优惠券,再以优惠价购买未选物品中优惠价最低的。 回退(反悔)操作可以用堆实现,具体实现: 用三个小根堆h1、h2、h3,分别存储未选物品的原价及编号、未选物品的优惠价及编号、已选物品退回优惠券的代价。 每次...

denge2160的博客 439

ArduPilot简介

一,什么是ArduPilot? ArduPilot是一个可信的,多用途的,开源的自动驾驶系统。该系统支持了非常多的交通工具类型,包括多旋翼无人机,传统直升机,固定翼飞行器,船,潜艇,巡逻车等。源码由大型开发者社区的专家和爱好者共同开发和维护。也欢迎更多的开发者加入源码的迭代演进,最好的“打开”方式就是加入开发者团队论坛。该论坛对所有人开放,在这里可以深入感受到开发者们对ArduPilot的热爱。 论坛链接:ArduPilot Discourse 开发者指南:Welcome to the ArduPil

从0到1,突破自己 5458

P3045 [USACO12FEB] 贪心 + 优先队列

题意 传送门 P3045 [USACO12FEB]Cow Coupons 题解 贪心地尽可能多地使用优惠券。若优惠券使用完,预算仍为花完,那么每次考虑多购买一头牛:选择未购买的牛中 pip_ipi​ 最低的;或者将已使用优惠券的牛中 pi−cip_i-c_ipi​−ci​ 最小的改为花费原价,使用优惠券购买未购买的牛中 cic_ici​ 最低的;或者放弃购买一头购价为 cic_ici​ 或 pjp_jpj​ 的牛,选择未购买的牛中两头牛,分别以 ci′,pj′c_{i'},p_{j'}ci′​,pj′​ 购

neweryyy的博客 263

深度学习工具包 DeepLearningToolbox

深度学习工具包Deprecation notice.-----This toolbox is outdated and no longer maintained.There are much better tools available for deep learning than this toolbox, e.g. [Theano](http://deeplearning.net/software/theano/), [torch](http://torch.ch/) or [tensorflow](http://www.tensorflow.org/)I would suggest you use one of the tools mentioned above rather than use this toolbox.Best, Rasmus.DeepLearnToolbox================A Matlab toolbox for Deep Learning.Deep Learning is a new subfield of machine learning that focuses on learning deep hierarchical models of data.It is inspired by the human brain's apparent deep (layered, hierarchical) architecture.A good overview of the theory of Deep Learning theory is[Learning Deep Architectures for AI](http://www.iro.umontreal.ca/~bengioy/papers/ftml_book.pdf)For a more informal introduction, see the following videos by Geoffrey Hinton and Andrew Ng.* [The Next Generation of Neural Networks](http://www.youtube.com/watch?v=AyzOUbkUf3M) (Hinton, 2007)* [Recent Developments in Deep Learning](http://www.youtube.com/watch?v=VdIURAu1-aU) (Hinton, 2010)* [Unsupervised Feature Learning and Deep Learning](http://www.youtube.com/watch?v=ZmNOAtZIgIk) (Ng, 2011)If you use this toolbox in your research please cite [Prediction as a candidate for learning deep hierarchical models of data](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6284)```@MASTERSTHESIS\{IMM2012-06284, author = "R. B. Palm", title = "Prediction as a candidate for learning deep hierarchical models of data", year = "2012",}```Contact: rasmusbergpalm at gmail dot comDirectories included in the toolbox-----------------------------------`NN/` - A library for Feedforward Backpropagation Neural Networks`CNN/` - A library for Convolutional Neural Networks`DBN/` - A library for Deep Belief Networks`SAE/` - A library for Stacked Auto-Encoders`CAE/` - A library for Convolutional Auto-Encoders`util/` - Utility functions used by the libraries`data/` - Data used by the examples`tests/` - unit tests to verify toolbox is workingFor references on each library check REFS.mdSetup-----1. Download.2. addpath(genpath('DeepLearnToolbox'));Example: Deep Belief Network---------------------```matlabfunction test_example_DBNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit RBM and visualize its weightsrand('state',0)dbn.sizes = [100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);figure; visualize(dbn.rbm{1}.W'); % Visualize the RBM weights%% ex2 train a 100-100 hidden unit DBN and use its weights to initialize a NNrand('state',0)%train dbndbn.sizes = [100 100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);%unfold dbn to nnnn = dbnunfoldtonn(dbn, 10);nn.activation_function = 'sigm';%train nnopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.10, 'Too big error');```Example: Stacked Auto-Encoders---------------------```matlabfunction test_example_SAEload mnist_uint8;train_x = double(train_x)/255;test_x = double(test_x)/255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit SDAE and use it to initialize a FFNN% Setup and train a stacked denoising autoencoder (SDAE)rand('state',0)sae = saesetup([784 100]);sae.ae{1}.activation_function = 'sigm';sae.ae{1}.learningRate = 1;sae.ae{1}.inputZeroMaskedFraction = 0.5;opts.numepochs = 1;opts.batchsize = 100;sae = saetrain(sae, train_x, opts);visualize(sae.ae{1}.W{1}(:,2:end)')% Use the SDAE to initialize a FFNNnn = nnsetup([784 100 10]);nn.activation_function = 'sigm';nn.learningRate = 1;nn.W{1} = sae.ae{1}.W{1};% Train the FFNNopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.16, 'Too big error');```Example: Convolutional Neural Nets---------------------```matlabfunction test_example_CNNload mnist_uint8;train_x = double(reshape(train_x',28,28,60000))/255;test_x = double(reshape(test_x',28,28,10000))/255;train_y = double(train_y');test_y = double(test_y');%% ex1 Train a 6c-2s-12c-2s Convolutional neural network %will run 1 epoch in about 200 second and get around 11% error. %With 100 epochs you'll get around 1.2% errorrand('state',0)cnn.layers = { struct('type', 'i') %input layer struct('type', 'c', 'outputmaps', 6, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %sub sampling layer struct('type', 'c', 'outputmaps', 12, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %subsampling layer};cnn = cnnsetup(cnn, train_x, train_y);opts.alpha = 1;opts.batchsize = 50;opts.numepochs = 1;cnn = cnntrain(cnn, train_x, train_y, opts);[er, bad] = cnntest(cnn, test_x, test_y);%plot mean squared errorfigure; plot(cnn.rL);assert(er<0.12, 'Too big error');```Example: Neural Networks---------------------```matlabfunction test_example_NNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);% normalize[train_x, mu, sigma] = zscore(train_x);test_x = normalize(test_x, mu, sigma);%% ex1 vanilla neural netrand('state',0)nn = nnsetup([784 100 10]);opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samples[nn, L] = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.08, 'Too big error');%% ex2 neural net with L2 weight decayrand('state',0)nn = nnsetup([784 100 10]);nn.weightPenaltyL2 = 1e-4; % L2 weight decayopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex3 neural net with dropoutrand('state',0)nn = nnsetup([784 100 10]);nn.dropoutFraction = 0.5; % Dropout fraction opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex4 neural net with sigmoid activation functionrand('state',0)nn = nnsetup([784 100 10]);nn.activation_function = 'sigm'; % Sigmoid activation functionnn.learningRate = 1; % Sigm require a lower learning rateopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex5 plotting functionalityrand('state',0)nn = nnsetup([784 20 10]);opts.numepochs = 5; % Number of full sweeps through datann.output = 'softmax'; % use softmax outputopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex6 neural net with sigmoid activation and plotting of validation and training error% split training data into training and validation datavx = train_x(1:10000,:);tx = train_x(10001:end,:);vy = train_y(1:10000,:);ty = train_y(10001:end,:);rand('state',0)nn = nnsetup([784 20 10]); nn.output = 'softmax'; % use softmax outputopts.numepochs = 5; % Number of full sweeps through dataopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, tx, ty, opts, vx, vy); % nntrain takes validation set as last two arguments (optionally)[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');```[![Bitdeli Badge](https://d2weczhvl823v0.cloudfront.net/rasmusbergpalm/deeplearntoolbox/trend.png)](https://bitdeli.com/free "Bitdeli Badge")

WINCC7.3破解文件

WINCC7.3硬件够破解文件,有需要的下载!WINCC7.3硬件够破解文件,有需要的下载!

P3045 [USACO12FEB]牛券Cow Coupons

洛谷 P3045 [USACO12FEB]牛券Cow Coupons 题目描述 一个错误的贪心思路:设优惠券有无数张,然后我们贪心去选,这样就会得到94的好成绩。(数据真水 #include<algorithm> #include<iostream> #include<cstdio> #include<queue> #define ll l...

weixin_30527323的博客 281

华为的C语言编程规范.pdf

华为技术有限公司内部技术规范。本规范制定了编写C语言程序的基本原则、规则和建议。从代码的清晰、简洁、可测试、安全、程序效率、可移植各个方面对C语言编程作出了具体指导。

[USACO12FEB]牛券Cow Coupons (洛谷P3045)

[USACO12FEB]牛券Cow Coupons 题目描述 Farmer John needs new cows! There are N cows for sale (1 <= N <= 50,000), and FJ has to spend no more than his budget of M units of money (1 <= M <= 10^14). ...

不知所云的博客 621

OV9734 DATASHEET,完整规格书

OV9734完整规格书,包括电气参数,尺寸规格,寄存器配置表等

P3045 [USACO12FEB]牛券Cow Coupons 贪心+优先队列

题目链接 贪心思路: 0.贪心撤回 1.首先如果所有的奶牛都使用了优惠券,那么优惠价格最少的前K个奶牛是必定包含在最终答案中的。如果情况不是这样,就意味着有一张优惠券用在了K+1到N区间的奶牛上,但是前K个奶牛中的那一个不选,显然这是不划算的,情况不是最优。 2.考虑全部对排序后的前K个奶牛使用优惠券,再建立一个由小到大保存(P[i]-C[i])的堆维护,再对[K+1,N]个奶牛进行选择...

学习记录 632

Luogu P3045 [USACO12FEB]牛券Cow Coupons

堆+贪心

curry的博客 258

「LG3045」「USACO12FEB」牛券Cow Coupons

Problem 题目描述 Farmer John needs new cows! There are N cows for sale (1 <= N <= 50,000), and FJ has to spend no more than his budget of M units of money (1 <= M <= 10^14). Cow i costs P_i mo...

weixin_30342827的博客 162

专题突破之反悔贪心——建筑抢修,Cow Coupons G, Voting (Hard Version),Cardboard Box

贪心真是用心出题,用脚造数据

412

2026-01-27 hetao1733837 的刷题笔记

如果说中间有点,那炸了,我们可以整一个 ……好的,那么,既然你每次找后面小的,为啥不在前面经过的找最大的?没错,似乎有半周了,我还没有走出原生动物……都是时间、努力、天分、运气的积淀……不让我用他的充电线给台灯充电,是害怕我把台灯当成充电宝给别的东西充电吗?可以理解为一个瓶颈吧……,所以,我们在一些情况下是尽可能把优惠券用完的,所以,很微妙啊?就是先贪使用优惠卷,然后每个物品再反悔一次,没了。,对于那些单点和没有起始节点或者结束节点的段……思考一下怎么更新……🤔按照时间贪一下……思考一下,模一下样例……

hetao1733837的博客 1000

牛券Cow Coupons

USACO12FEB 久违的奶牛题。 题意: FJ准备买一些新奶牛,市场上有 $ N $ 头奶牛 $ (1 \leq N \leq 50000) $ ,第i头奶牛价格为 $ P_i (1 \leq P_i \leq 10^9) $ 。FJ有K张优惠券,使用优惠券购买第i头奶牛时价格会降为 $ C_i(1\leq C_i \leq P_i) $ ,每头奶牛只能使用一次优惠券。FJ想...

weixin_30344995的博客 281

【算法拾光】队列|在每个树⾏中找最⼤值 + 最后⼀块⽯头的重量

本文总结两道经典算法题:一是通过层序遍历(BFS)逐层找最大值,利用队列分层处理,每层维护最大值;二是用大根堆(优先队列)模拟石头碰撞过程,每次取最大两块石头,差值重新入堆,直至剩余一块或无石。前者适用于树的层次遍历,后者适合动态获取最值场景。核心思想:队列用于分层遍历,堆用于高效取极值。

wuqingyigexiaoba的博客 204

把 KV Cache 压到 FP4:BitDecoding-FP4 的算法-系统协同设计复盘

长上下文推理卡在KV Cache的显存与带宽上,而现有FP4方案要么精度崩、要么速度废。这篇文章复盘BitDecoding-FP4如何用三个算法补丁加一个系统重构,在B300上把服务吞吐提升2.4–3.0倍,精度几乎不掉。

helloagent的博客 324

优选算法:分治-归并排序

交易逆序对的总数

Wangshijie1015的博客 154

408 算法 06|堆与 Top-K:最小的 10 个数,到底该用数组还是堆

2022(42) 找 100 万个数里最小的 10 个,官方给了"10 元素有序数组"和"大根堆"两种答案。我把两种都实现并数了比较次数:k=10 时两者几乎打平,k=10000 时堆少 111 倍。另附 2021(42) 计数排序的比较次数与稳定性实测。

m0_56226131的博客 464
上一篇: P4198 楼房重建 题解
下一篇: P10997 【MX-J3-T4】 Partition 题解
遏草
博客等级 码龄3年 115粉丝 39原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明:

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

余额充值