文章目录
1.AcWing 1842. 牛奶桶
AC代码:
//完全背包
#include <algorithm>
#include <cmath>
using namespace std;
int a[4],m;
int dp[1000];
int main(){
scanf("%d %d %d",&a[1],&a[2],&m);
for(int i=1;i<=2;i++){
for(int j=a[i];j<=m;j++){
dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
}
printf("%d\n",dp[m]);
return 0;
}
2.AcWing 1824. 钻石收藏家
AC代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[1010];
int main(){
int n,k;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+1+n);
int maxx = 0;
for(int i=1;i<=n;i++){
int sum = 0;
for(int j=i;j<=n;j++){
if(a[j]-a[i]>k)
break;
else
sum++;
}
maxx = max(maxx,sum);
}
printf("%d\n",maxx);
return 0;
}
3.AcWing 1902. 马拉松
AC代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
struct xa{
int x;
int y;
}a[100010];
int dis[100010];
int main(){
int n,maxx = 0,sum = 0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d %d",&a[i].x,&a[i].y);
for(int i=2;i<=n;i++)
dis[i] = abs(a[i].x-a[i-1].x)+abs(a[i].y-a[i-1].y),sum+=dis[i];
for(int i=2;i<n;i++)
maxx = max(maxx,dis[i]+dis[i+1]-(abs(a[i+1].x-a[i-1].x)+abs(a[i+1].y-a[i-1].y)));
printf("%d\n",sum-maxx);
return 0;
}
4.AcWing 1892. 奶牛线路
AC代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int a,b,n,minn = 99999;
scanf("%d %d %d",&a,&b,&n);
for(int i=1;i<=n;i++){
int cost , m , flag = 0;
scanf("%d %d",&cost,&m);
for(int j=1;j<=m;j++){
int x;
scanf("%d",&x);
if(x == a)
flag = 1;
if(x == b && flag == 1)
minn = min(minn,cost);
}
}
if(minn == 99999)
printf("-1\n");
else
printf("%d\n",minn);
return 0;
}
5.AcWing 1883. 删减
AC代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
string s,t,r;
int main(){
cin >> s >> t;
int sl = s.size();
int tl = t.size();
for(int i=0;i<sl;i++){
r+=s[i];
if(r.size() >= tl && r.substr(r.size()-tl,tl) == t){
r.erase(r.end()-tl,r.end());
}
}
cout<< r <<endl;
return 0;
}
6.AcWing 1874. 哞加密
AC代码:
#include<bits/stdc++.h>
using namespace std;
char s[55][55];
int main(){
int n,m,maxx=0;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>s[i];
for(char i='A';i<='Z';i++)
for(char j='A';j<='Z';j++){
if(i!=j&&i!='M'&&j!='O'){
int sum=0;
for(int x=0;x<n;x++)
for(int y=0;y<m;y++){
if(y+2<m&&s[x][y]==i&&s[x][y+1]==j&&s[x][y+2]==j)sum++;// x ---> ijj
if(y+2<m&&s[x][y]==j&&s[x][y+1]==j&&s[x][y+2]==i)sum++;// x ---> jji
if(x+2<n&&s[x][y]==i&&s[x+1][y]==j&&s[x+2][y]==j)sum++;// y ---> ijj
if(x+2<n&&s[x][y]==j&&s[x+1][y]==j&&s[x+2][y]==i)sum++;// y ---> jji
if(x+2<n&&y+2<m&&s[x][y]==i&&s[x+1][y+1]==j&&s[x+2][y+2]==j)sum++;// ↘ --> ijj
if(x+2<n&&y+2<m&&s[x][y]==j&&s[x+1][y+1]==j&&s[x+2][y+2]==i)sum++;// ↘ --> jji
if(x+2<n&&y-2>=0&&s[x][y]==i&&s[x+1][y-1]==j&&s[x+2][y-2]==j)sum++;// ↙ --> ijj
if(x+2<n&&y-2>=0&&s[x][y]==j&&s[x+1][y-1]==j&&s[x+2][y-2]==i)sum++;// ↙ --> jji
}
maxx=max(maxx,sum);
}
}
cout<<maxx<<endl;
}