7.22作业

合集 - 刷题集(97)

1.妖梦拼木棒2023-05-232.[USACO1.2]回文平方数 Palindromic Squares2023-05-243.[COCI2012-2013#1] LJUBOMORA2023-05-254.火柴棒等式2023-05-255.Kieszonkowe2023-05-256.[COCI2014-2015#5] TRAKTOR2023-05-267.硬币翻转2023-05-268.[蓝桥杯 2020 省 AB1] 走方格2023-05-269.P2097 资料分发2023-05-2610.[AHOI2005]约数研究2023-05-2611.[NOIP2004 普及组] 火星人2023-05-2612.我焯,原神(这真是个题)2023-05-2613.滑雪 OJ36512023-05-2414.CV的人有福啦!YTU贪心训练2(部分注释)2023-05-2715.砝码称重2023-05-2716.警钟长鸣-----找零钱2023-05-2817.[USACO09OCT]Barn Echoes G2023-05-2818.【CSGRound2】光骓者的荣耀2023-05-2919.初见蓝桥杯2023-05-3020.[蓝桥杯 2022 省 B] 扫雷2023-05-3121.开餐馆2023-05-3122.P9241 [蓝桥杯 2023 省 B] 飞机降落2023-06-0123.P7083 [NWRRC2013] Energy Tycoon2023-06-0324.高精度2023-06-0425.P7954 [COCI2014-2015#6] PAPRIKA2023-06-0426.(输出路径搜索)[USACO06OCT] Cows on Skates G2023-06-0427.畜栏保留问题2023-06-0428.(贪心+搜索+剪枝)P8801 [蓝桥杯 2022 国 B] 最大数字2023-06-0529.蓝桥杯 入门----普及-2023-06-0630.[NOIP2016 提高组] 玩具谜题2023-06-0631.[NOIP2002 提高组] 字串变换(无向图查重)2023-06-0632.[NOIP2000 提高组] 单词接龙2023-06-0733.POJ 硬币2023-06-0734.动态规划学习 1(最长上升子序列问题)2023-06-0735.动态规划学习 2(背包问题及其变形)2023-06-0836. 切割回文2023-06-1037.[NOIP2001 提高组] 数的划分(剪枝)2023-06-1038.字符串转换数字,sscanf和sprintf大法2023-06-1039.[CTSC1997] 选课(树状DP)2023-06-1040. k 倍区间(同余定理,组合数)2023-06-1141.[蓝桥杯 2018 省 AB] 全球变暖2023-06-1142.马的遍历(对bfs的更深一层探讨)2023-06-1143.找零钱2023-06-1144.Pasha Maximizes2023-06-1245.Newspaper Headline2023-06-1246.Balanced Ternary String2023-06-1347.(数论)素数,质数2023-06-1348.(数论) 约数2023-06-1349.Helping the Nature2023-06-1450.(博弈论)Even Number Addicts2023-06-1451.Present2023-06-1552.Mr. Kitayuta's Colorful Graph(二维并查集,弱化版)2023-06-1653.Edgy Trees(dfs,并查集,快速幂,树形结构,红黑树)2023-06-1654.并查集2023-05-2455.再谈 前缀和,差分,离散化2023-06-1656.Best Cow Fences(前缀和+特殊二分)2023-06-1757.二分2023-06-1758.同类型,类背包动态规划,选地dp2023-06-1759.Primes on Interval(欧拉筛+二分+滑动窗口)2023-06-1860.字符串(KMP , Trie树 , STL)2023-06-1861.Codeforces1 #879 div.22023-06-1962.Add Modulo 10(数论,思维,数学,规律)2023-06-2063.期末考试YTU4035: Shmily(数学,等差数列)2023-06-2064.[POI2006] OKR-Periods of Words2023-06-2165.Getting Zero(Bfs)2023-06-2166.快速幂2023-06-2167.Dreaming of Freedom(数论,贪心)2023-06-2368.Scoring Subsequences2023-06-2469.Dolce Vita2023-06-2970.Cake Assembly Line2023-06-2971.Constructive Problem2023-06-3072.Forever Winter2023-06-3073.Maximum Sum(前缀和)2023-07-1074.Contrast Value(数学规律)2023-07-1075.Lamps(STL+双端队列)2023-07-1076.Long Long2023-07-1177.Sum in Binary Tree2023-07-1178.Apple Tree(树状搜索,树形DP)2023-07-1179.Strong Password(贪心思想)2023-07-1280.Come Together2023-07-1281.Notepad2023-07-1382.Hamiltonian Wall2023-07-1383.7.17作业2023-07-1684.逛画展(双指针)2023-07-1985.#8852023-07-2086.树状数组2023-07-2087.Subsequence Addition2023-07-22

88.7.22作业2023-07-22

89.Diverse Substrings2023-07-2490.Tracking Segments(二分,区间前缀)2023-07-2791.最大食物链计数2023-07-2792.线段树12023-07-2293.[TJOI2007] 线段(状态机)2023-07-2994.#8782023-07-3095.测试12023-07-3096.李白打酒2023-07-3097.砍竹子2023-07-30

收起

数字三角形
#include <bits/stdc++.h>
//#define int long long
using namespace std;
const int N=1e4+10,mod=1e9+7;
string s;
int n,t,a[N][N],f[N][N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++) cin>>a[i][j];
    f[1][1]=a[1][1];
    for(int i=2;i<=n;i++)
        for(int j=1;j<=i;j++)
            f[i][j]=max(f[i-1][j]+a[i][j],f[i-1][j-1]+a[i][j]);
    for(int i=1;i<=n;i++) res=max(res,f[n][i]);
    cout<<res<<endl;
    return 0;
}

采药
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e4+10,mod=1e9+7;
string s;
int n,t,a[N][N],f[N],res,num,ans,m,v[N],w[N];
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>m>>n;
    for(int i=1;i<=n;i++) cin>>w[i]>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=m;j>=w[i];j--) f[i]=max(f[i],f[i-w[i]]+v[i]);
    cout<<f[m]<<endl;
    return 0;
}
最大字段和
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
int s[N];
int n,t,a[N],f[N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>m;
        f[i]=max(m,f[i-1]+m);
        res=max(res,f[i]);
    }
    cout<<res<<endl;
    return 0;
}
装箱问题
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
string s;
int n,t,a[N],f[N],res,num,ans,m,w[N];
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>m>>n;
    for(int i=1;i<=n;i++) cin>>w[i];
    for(int i=1;i<=n;i++)
        for(int j=m;j>=w[i];j--) f[j]=max(f[j],f[j-w[i]]+w[i]);
    cout<<m-f[m];
    return 0;
}
疯狂的采药
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
string s;
int n,t,a[N],f[N],res,num,ans,m,w[N],v[N];
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>m>>n;
    for(int i=1;i<=n;i++) cin>>w[i]>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=w[i];j<=m;j++) f[j]=max(f[j],f[j-w[i]]+v[i]);
    cout<<f[m];
    return 0;
}
小A点菜
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
string s;
int n,t,a[N],f[N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    f[1]=1;
    for(int i=1;i<=n;i++)
        for(int j=m;j>=a[i];j--) f[j]+=f[j-a[i]];
    cout<<f[m]<<endl;
    return 0;
}
kkksc03考前临时抱佛脚
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
int s[5];
int n,t,a[N],f[N],res,num,ans,m,r,l;
bool vis[N];
void dfs(int u,int v)
{
    if(u==s[v]+1){
        ans=min(ans,max(l,r));
        return;
    }
    l+=a[u],dfs(u+1,v),l-=a[u];
    r+=a[u],dfs(u+1,v),r-=a[u];
}
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    for(int i=1;i<=4;i++) cin>>s[i];
    for(int i=1;i<=4;i++){
        ans=0x3f3f3f,l=0,r=0;
        for(int j=1;j<=s[i];j++) cin>>a[j];
        dfs(1,i),res+=ans;
    }
    cout<<res<<endl;
    return 0;
}
摆花
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
string s;
int n,t,a[N],f[N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    f[0]=1;
    for(int i=1;i<=n;i++)
        for(int j=m;j>=0;j--)
            for(int k=1;k<=min(a[i],j);k++) f[j]+=f[j-k]&mod;
    cout<<f[m];
    return 0;
}

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e4+10,mod=1e6+7;
string s;
int n,t,a[N],f[N][N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    f[0][0]=1;
    for(int i=1;i<=n;i++)
        for(int j=0;j<=m;j++)
            for(int k=0;k<=min(j,a[i]);k++) f[i][j]=(f[i][j]+f[i-1][j-k])%mod;
    cout<<f[n][m];
    return 0;
}

 

//[NOIP2006 提高组] 金明的预算方案
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+10;
int f_not_mainv[N][3],f_not_mainw[N][3],res,ans,num,n,m,v[N],w[N],p[N],f[N];
signed main()
{
    cin>>m>>n;
    for(int i=1;i<=n;i++){
        int a,b,c;
        cin>>a>>b>>c;
        if(c==0){
            v[i]=a*b;
            w[i]=a;
        }
        else{
            f_not_mainw[c][++f_not_mainw[c][0]]=a;
            f_not_mainv[c][f_not_mainw[c][0]]=a*b;
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=m;j>=w[i];j--){
            f[j]=max(f[j],f[j-w[i]]+v[i]);
            if(j>=w[i]+f_not_mainw[i][1]) f[j]=max(f[j],f[j-f_not_mainw[i][1]-w[i]]+f_not_mainv[i][1]+v[i]);
            if(j>=w[i]+f_not_mainw[i][1]+f_not_mainw[i][2]) 
                f[j]=max(f[j],f[j-f_not_mainw[i][1]-w[i]-f_not_mainw[i][2]]+f_not_mainv[i][1]+f_not_mainv[i][2]+v[i]);
        }
    cout<<f[m]<<endl;
    return 0;
}

 

//过河卒
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200;
int f[N][N],n,m,x,y;
int dx[]={0,-2,-2,-1,1,2,2,1,-1},dy[]={0,-1,1,2,2,1,-1,-2,-2};
bool vis[N][N];
signed main()
{
    cin>>n>>m>>x>>y;
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++) f[i][j]=1;
    for(int i=0;i<9;i++){
        int x1=x+dx[i],y1=y+dy[i];
        if(x1>=0&&x1<=20&&y1>=0&&y1<=20)
        vis[x1][y1]=true,f[x1][y1]=0;
    }
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++){
            if(vis[i][j]) continue;
            if(j==0&&i==0) continue;
            else if(j==0) f[i][j]=f[i-1][j];
            else if(i==0) f[i][j]=f[i][j-1];
            else f[i][j]=f[i-1][j]+f[i][j-1];
        }
    cout<<f[n][m];
    return 0;
}

 

//5 倍经验日
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e3+1e2;
int n,m,f[N],lose[N],win[N],use[N],res;
signed main()
{
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>lose[i]>>win[i]>>use[i];
    for(int i=0;i<n;i++)
        for(int j=m;j>=0;j--){
            int tmp=f[j];
            tmp=max(f[j],f[j]+lose[i]);
            if(j>=use[i]) f[j]=max(f[j],f[j-use[i]]+win[i]);
            f[j]=max(tmp,f[j]);
        }
    res=5*f[m];
    cout<<res<<endl;
    return 0;
}

 

__EOF__

本文作者：Sakurajimamai
本文链接：https://www.cnblogs.com/o-Sakurajimamai-o/p/17574119.html
关于博主：评论和私信会在第一时间回复。或者直接私信我。
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！