1.数字三角形 Number Triangles
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int triangle[N][N];
int f[N][N];
int main()
{
int n;
cin >> n;
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= i;j++)
{
cin >> triangle[i][j];
}
}
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= i;j++)
{
f[i][j] = triangle[i][j]+max(f[i-1][j-1],f[i-1][j]);
}
}
int ans = 0;
for(int i = 1;i <= n;i++)
ans = max(ans,f[n][i]);
cout << ans;
return 0;
}
2.滑雪
记忆化搜索+深搜
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int all[N][N];
int f[N][N];
int dx[4] = {-1,1,0,0};
int dy[4] = {0,0,-1,1};
int n,m;
int dfs(int x,int y)
{
if(f[x][y])
return f[x][y];
f[x][y] = 1;
for(int i = 0;i < 4;i++)
{
int a = x+dx[i],b = y+dy[i];
if(a >= 1 && a <= n && b >= 1 && b <= m && all[x][y] > all[a][b])
{
dfs(a,b);
f[x][y] = max(f[x][y],f[a][b]+1);
}
}
return f[x][y];
}
int main()
{
cin >> n >> m;
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= m;j++)
{
cin >> all[i][j];
}
}
int ans = 0;
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= m;j++)
{
ans = max(ans,dfs(i,j));
}
}
cout << ans;
return 0;
}
3.挖地雷
#include <bits/stdc++.h>
using namespace std;
const int N = 30;
int num[N];
int kd[N][N];
int f[N];//f[i]表示到第i个时的地雷数
int p[N];//前一个是由哪个来的
void DFS(int x)
{
if(p[x])
DFS(p[x]);
cout << x << " ";
}
int main()
{
int n;
cin >> n;
for(int i = 1;i <= n;i++)
{
cin >> num[i];
}
for(int i = 1;i < n;i++)
{
for(int j = i+1;j <= n;j++)
{
cin >> kd[i][j];
}
}//从第i个到第j个是否可达
for(int i = 1;i <= n;i++)
{
f[i] = num[i];
for(int j = i-1;j > 0;j--)
{
if(kd[j][i] && f[i] < f[j]+num[i])
{
f[i] = f[j]+num[i];
p[i] = j;
}
}
}
int ans = 0,beg = 0;
for(int i = 1;i <= n;i++)
{
if(ans < f[i])
{
ans = f[i];
beg = i;
}
}
DFS(beg);
cout << endl;
cout << ans;
return 0;
}
4.最大食物链计数
拓扑排序
最长的一条食物链一定是从入度为0(不被任何生物吃)的点指向出度为0(不吃任何生物)的点,根据样例画图有:
#include <bits/stdc++.h>
using namespace std;
const int Mode = 80112002;
const int N = 500010;
int d[N],h[N],e[N],ne[N],idx,n,m;
int f[N];//f[i]表示到达i的路径数
int first[N];
void Add(int a,int b)
{
e[idx] = b;
ne[idx] = h[a];
h[a] = idx++;
d[b]++;
first[a]++;
}
//用邻接表来存捕食关系,a吃b表示有一条有向边从a指向b
//d[]数组表示入度数,first[]数组表示出度数
void bfs()
{
queue<int> q;
for(int i = 1;i <= n;i++)
if(d[i] == 0)
{
q.push(i);
f[i] = 1;//入度为0即为最高一级的捕食者,入队,路径数初始化为1
}
while(q.size())
{
int u = q.front();
q.pop();
for(int i = h[u];i != -1;i = ne[i])
{
int j = e[i];
f[j] = (f[u]+f[j])%Mode;//因为是从最高一级的捕食者倒推,所以被捕食者的路径数是在增加的
d[j]--;
if(d[j] == 0)
{
q.push(j);
}
}
}
return ;
}
int main()
{
cin >> n >> m;
memset(h,-1,sizeof h);
for(int i = 1;i <= m;i++)
{
int a,b;
cin >> a >> b;//b吃a
Add(b,a);
}
bfs();
int ans = 0;
for(int i = 1;i <= n;i++)
{
if(first[i] == 0)//最后一级的生物条数最多
ans = (ans + f[i])%Mode;
}
cout << ans;
return 0;
}
5.采药
明显的01背包
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int tim[N],value[N];
int f[N][N];
int main()
{
int t,m;
cin >> t >> m;
for(int i = 1;i <= m;i++)
{
cin >> tim[i] >> value[i];
}
for(int i = 1;i <= m;i++)
{
for(int j = t;j >= 0;j--)
{
if(j >= tim[i])
f[i][j] = max(f[i-1][j],f[i-1][j-tim[i]]+value[i]);
else
f[i][j] = f[i-1][j];
}
}
cout << f[m][t];
return 0;
}
6.疯狂的采药
完全背包
#include <bits/stdc++.h>
using namespace std;
const int N = 10000010;
long long tim[N],value[N];
long long f[N];
int main()
{
long long t,m;
cin >> t >> m;
for(long long i = 1;i <= m;i++)
{
cin >> tim[i] >> value[i];
}
for(long long i = 1;i <= m;i++)
{
for(long long j = tim[i];j <= t;j++)
{
f[j] = max(f[j],f[j-tim[i]]+value[i]);
}
}
cout << f[t];
return 0;
}
7.5倍经验日
01背包
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
long long lose[N],win[N],use[N];
long long f[N][N];
int main()
{
long long n,x;
cin >> n >> x;
for(long long i = 1;i <= n;i++)
{
cin >> lose[i] >> win[i] >> use[i];
}
for(long long i = 1;i <= n;i++)
{
for(long long j = 0;j <= x;j++)
{
//1. >= use[i] 会赢
//2. < use[i] 会输,比较用和不用
f[i][j] = f[i-1][j]+lose[i];
if(j >= use[i])
{
f[i][j] = max(f[i][j],f[i-1][j-use[i]]+win[i]);
}
}
}
cout << f[n][x]*5;
return 0;
}
8.过河卒
#include <bits/stdc++.h>
using namespace std;
const int N = 40;
long long a[N][N];
bool flag[N][N];
int dx[9] = {0,-2,-1,1,2,2,1,-1,-2};
int dy[9] = {0,1,2,2,1,-1,-2,-2,-1};
int main()
{
int cx,cy;//马
int bx,by;//终点
cin >> bx >> by >> cx >> cy;
bx += 2;
by += 2;
cx += 2;
cy += 2;
a[2][1] = 1;
for(int i = 0;i <= 8;i++)
flag[cx+dx[i]][cy+dy[i]] = true;
for(int i = 2;i <= bx;i++)
{
for(int j = 2;j <= by;j++)
{
if(flag[i][j])
continue;
a[i][j] = a[i-1][j]+a[i][j-1];
}
}
cout << a[bx][by];
return 0;
}