101 特殊的正方形
按照题意模拟即可，注意判断奇偶的情况下
#include<bits/stdc++.h>
#define ll long long
using namespace std;
char mp[104][104];
void solve(){
int n; cin >> n;
memset(mp,'.',sizeof mp);
int res = n;
int l = 1, r = n;
int cnt = 1;
while(l <= r){
for(int i = l; i <= r; i++){
mp[cnt][i] = '+';
}
for(int i = l; i <= ceil(n * 1.0/ 2); i++){
mp[i][l] = '+';
mp[i][r] = '+';
}
l += 2;
r -= 2;
cnt += 2;
}
for(int i = 1; i <= ceil(n * 1.0 / 2); i++){
for(int j = 1; j <= n; j++){
cout << mp[i][j];
}
cout << '\n';
}
for(int i = n / 2; i >= 1; i--){
for(int j = 1; j <= n; j++){
cout << mp[i][j];
}
cout << '\n';
}
}
int main(){
solve();
return 0;
}
102 走楼梯
首先确定从0开始转移，然后可以走1步和两步两种方式，以此得到转移方程式
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[1000][4];
void solve(){
int n;
cin >> n;
dp[0][0] = 1;
for(int i = 1; i <= n; i++){
dp[i][0] += dp[i - 1][0] + dp[i - 1][1] + dp[i - 1][2];
if(i >= 2) dp[i][1] += dp[i - 2][0];
if(i >= 2) dp[i][2] += dp[i - 2][1];
}
ll ans = 0;
ans += dp[n][0] + dp[n][1] + dp[n][2];
cout << ans << '\n';
}
int main(){
solve();
return 0;
}
103 走路
我们可以选择向右走 ai 或者 bi 个位置，我们发现如果使用使用BFS，范围会过大，我们考虑用dp来做，注意要初始化dp的值
#include<bits/stdc++.h>
#define ll long long
using namespace std;
bitset<100004>dp[104];
void solve(){
int n,m;
cin >> n >> m;
vector<int> a(n + 10,0);
vector<int> b(n + 10,0);
for(int i = 1; i <= n; i++){
cin >> a[i] >> b[i];
}
dp[0][0] = 1;
for(int i = 1; i <= n; i++){
dp[i] |= (dp[i - 1] << a[i]);
dp[i] |= (dp[i - 1] << b[i]);
}
for(int i = 0; i <= m; i++) cout << dp[n][i]; cout << '\n';
}
int main(){
solve();
return 0;
}
104 简单分数统计
如题目所说，简单统计，按照题意统计即可，注意答案按照题目给的顺序输出
#include<bits/stdc++.h>
#define ll long long
using namespace std;
map<string,int> pro;
map<string,int> pt;
string peo[10004];
void solve(){
int n,m,k;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
cin >> peo[i];
pt[peo[i]] = 0;
}
for(int i = 1; i <= m; i++){
string s;
int p;
cin >> s >> p;
pro[s] = p;
}
for(int i = 1; i <= k; i++){
string s1,s2;
string t;
cin >> s1 >> s2 >> t;
if(t == "AC" && pt.count(s1) > 0){
pt[s1] += pro[s2];
}
else continue;
}
for(int i = 1; i <= n; i++){
cout << peo[i] << ' ' << pt[peo[i]] << '\n';
}
}
int main(){
solve();
return 0;
}
105 Alice的德州扑克
题目巨长，读懂题目依次用STL容器来判断即可，小模拟题目
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct node {
int val,kd;
}p[6];
bool cmp(node a,node b){
if(a.val == b.val) return a.kd < b.kd;
return a.val < b.val;
}
void solve(){
set<int> st;
for(int i = 1; i <= 5; i++){
cin >> p[i].val;
}
for(int i = 1; i <= 5; i++){
cin >> p[i].kd;
st.insert(p[i].kd);
}
sort(p + 1,p + 1 + 5,cmp);
int ok = 1;
for(int i = 1; i < 5; i++){
if(p[i].val + 1 != p[i + 1].val){
ok = 0;
break;
}
}
if(ok){
if(st.size() == 1) {
if(p[5].val == 14){
cout << "ROYAL FLUSH" << '\n';
}
else {
cout << "STRAIGHT FLUSH" << '\n';
}
}
else cout << "STRAIGHT" << '\n';
}
else if(st.size() == 1) {
cout << "FLUSH" << '\n';
}
else {
map<int,int> mp;
for(int i = 1; i <= 5; i++) {
mp[p[i].val]++;
}
int maxn = 0;
for(auto it : mp){
maxn = max(maxn,it.second);
}
if(maxn == 4){
cout << "FOUR OF A KIND" << '\n';
}
else {
if(maxn == 3 && mp.size() == 2) cout << "FULL HOUSE" << '\n';
else cout << "FOLD" << '\n';
}
}
}
int main(){
solve();
return 0;
}
106 订单编号
我们可以考虑通过并查集来做，将使用过的数字并在一起，每次查找最大的数来作为下一个数，注意范围的问题，我们考虑使用map来存储并查集
#include<bits/stdc++.h>
#define ll long long
using namespace std;
unordered_map<int,int> mp;
int find(int x){
if(mp[x] == x) return x;
else return mp[x] = find(mp[x]);
}
void mg(int x,int y){
int f1 = find(x);
int f2 = find(y);
if(f1 == f2) return;
if(f1 > f2) swap(f1,f2);
mp[f1] = f2;
}
void solve(){
int n;
cin >> n;
vector<int> a(n + 10,0);
for(int i = 1; i <= n; i++){
cin >> a[i];
mp[a[i]] = a[i];
}
vector<int> ans(n + 10);
for(int i = 1; i <= n; i++){
int now = a[i];
int to = find(now);
if(to == now) {
ans[i] = now;
if(mp.count(now + 1) == 0) mp[now + 1] = now + 1;
mg(now,now + 1);
}
else {
ans[i] = to;
if(mp.count(to + 1) == 0) mp[to + 1] = to + 1;
mg(to,to + 1);
}
}
for(int i = 1; i <= n; i++) cout << ans[i] << ' '; cout << '\n';
}
int main(){
solve();
return 0;
}
107 饿饿 饭饭
首先我们用二分去找到只差一轮就可以完成打饭的地方，然后用队列模拟即可
#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
int n,k;
vector<ll> a(100005,0);
int ck(int x){
ll spd = 0;
for(int i = 1; i <= n; i++){
if(a[i] >= x) spd += x;
else spd += a[i];
}
return spd;
}
void solve(){
cin >> n >> k;
ll all = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
all += a[i];
}
if(all < k) {
cout << -1 << '\n';
}
else if(all == k) {
}
else {
ll l = 1,r = k;
ll ls = 0;
while(l <= r){
ll mid = (l + r) >> 1;
ll check = ck(mid);
if(check <= k){
ls = max(ls,mid);
l = mid + 1;
}
else {
r = mid - 1;
}
}
vector<int> ans;
queue<pair<int,int> > les;
int yd = 0;
for(int i = 1; i <= n; i++){
if(a[i] > ls) {
les.push({a[i] - ls,i});
yd += ls;
}
else yd += a[i];
}
ll lt = k - yd;
while(les.size() && lt){
pair<int,int> now = les.front();
les.pop();
if(now.first != 1) {
les.push({now.first - 1,now.second});
}
lt--;
}
while(les.size()){
pair<int,int> now = les.front();
les.pop();
ans.push_back(now.second);
}
int sz = ans.size();
if(sz == 0){
}
else {
for(int i = 0; i < sz; i++){
cout << ans[i] << " \n"[i == sz - 1];
}
}
}
}
int32_t main(){
solve();
return 0;
}
201 任务分配
弄清楚状态方程然后转移即可，就是不懂为啥要排序才能过，哈哈😅
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int dp[1004];
struct node {
int l,r,w;
}ms[1004];
bool cmp(node a,node b){
if(a.r == b.r) return a.l > b.l;
return a.r < b.r;
}
void solve(){
int n; cin >> n;
for(int i = 1; i <= n; i++){
cin >> ms[i].l >> ms[i].r >> ms[i].w;
}
sort(ms + 1,ms + 1 + n,cmp);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= ms[i].l; j++){
dp[j] = max(dp[j],dp[j - 1]);
if(j == ms[i].l){
dp[ms[i].r] = max(dp[ms[i].l] + ms[i].w,dp[ms[i].r]);
}
}
}
int maxn = 0;
for(int j = 1; j <= 1000; j++){
maxn = max(dp[j],maxn);
}
cout << maxn << '\n';
}
int main(){
solve();
return 0;
}
202 路径计数
通过范围我们可以看出，这道题需要使用dp进行时间压缩，然后我们发现只要当前的位置不为0就可以让前面的状态转移过来
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
ll dp[104][104];
int mp[104][104];
void solve(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
cin >> mp[i][j];
}
}
dp[1][1] = 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(mp[i][j] == 1) {
dp[i][j] += dp[i - 1][j];
dp[i][j] %= mod;
dp[i][j] += dp[i][j - 1];
dp[i][j] %= mod;
}
}
}
cout << dp[n][n] << '\n';
}
int main(){
solve();
return 0;
}
203 最大和上升子序列
我们维护一个序列dp，让dp[i]表示以i为结尾的最大上升子序列的和，然后for循环遍历更新，注意初始化
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int dp[1000004];
void solve(){
int n;
cin >> n;
vector<int> a(n + 10,0);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= n; i++){
dp[a[i]] = a[i];
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(i == j) continue;
if(a[j] > a[i] && j > i){
dp[a[j]] = max(dp[a[j]],a[j] + dp[a[i]]);
}
}
}
int ans = 0;
for(int i = 1; i <= n; i++){
ans = max(ans,dp[a[i]]);
}
cout << ans << '\n';
}
int main(){
solve();
return 0;
}
204 加一
我们首先找规律，最后发现dp[i][k] = dp[i][k - 9] + dp[i][k - 10] 这个状态，我们遍历全部的m和0-9这10个数位，依次处理即可
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
int dp[13][200004];
void solve(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for(int i = 0; i <= 9; i++){
for(int j = 0; j <= 10; j++) {
if(i + j < 10) dp[i][j] = 1;
else dp[i][j] = 2;
}
}
for(int i = 0; i <= 9; i++){
for(int k = 10; k <= 200000; k++){
dp[i][k] = dp[i][k - 9] + dp[i][k - 10];
dp[i][k] %= mod;
}
}
int t; cin >> t;
while(t--){
int n,m;
cin >> n >> m;
int x = n;
ll ans = 0;
while(x){
ans += dp[x % 10][m];
ans %= mod;
x /= 10;
}
cout << ans << '\n';
}
}
int main(){
solve();
return 0;
}
待更新
354
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
