problem B:
解题代码:
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#define LL long long
using namespace std;
const int N = 1e5 + 10;
int ne[2*N],e[2*N],h[N],dis[N],st[N],w[2*N],arr[N];
int n,m,idx,k;
void add(int a,int b,int c)
{
e[idx] = b,w[idx] = c,ne[idx] = h[a],h[a] = idx++;
}
void spfa()
{
st[1] = 1;
dis[1] = 0;
queue<int> q;
q.push(1);
while(q.size())
{
auto t = q.front();
q.pop();
st[t] = 0;
for(int i = h[t];i != -1; i = ne[i])
{
int j = e[i];
if(dis[j] > dis[t] + w[i])
{
dis[j] = dis[t] + w[i];
if(!st[j])
{
st[j] = 1;
q.push(j);
}
}
}
}
return ;
}
int main()
{
memset(h,-1,sizeof h);
memset(dis,0x3f3f3f3f,sizeof dis);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
scanf("%d",&k);
for(int i=1;i<=k;i++)
scanf("%d",&arr[i]);
spfa();
int maxx = -1,ans = -1;
for(int i=1;i<=k;i++)
if(maxx<=dis[arr[i]]){
maxx = dis[arr[i]];
ans = i;
}
cout << ans << "\n";
return 0;
}
problem C
可从i:1-n枚举每个物品 在j:1-m范围内的最大重量 转移方程f[j] = min(f[j],f[j-v[i]] + w[i])
DP方法:
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10;
int v[N],w[N];
int f[N];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d%d",&v[i],&w[i]);
for(int i = 1;i <= n; i++)
for(int j = 1;j <= m; j++)
if(v[i]<=j)
f[j] = max(f[j],f[j-v[i]] + w[i]);
cout << f[m] << "\n";
return 0;
}
problem F:
将每个蜂巢造成的伤害值进行排序,从最小端开始对 伤害值进行累计,找到<=h的最大数量
解题代码
#include <iostream>
#include <algorithm>
#define LL long long
using namespace std;
const int N = 1e3 + 10;
int arr[N];
int n,h;
int main()
{
scanf("%d%d",&n,&h);
for(int i=1;i<=n;i++)
scanf("%d",&arr[i]);
sort(arr+1,arr+1+n);
int sum = 0;
int i = 1;
while(sum + arr[i] <= h && i<=n)
{
sum += arr[i];
i++;
}
cout << i - 1 << "\n";
return 0;
}