题目要求都在图片里,要求用C++。谢谢
3条回答 默认 最新
- threenewbee 2019-10-20 07:53关注
#include <stdlib.h> #include <string.h> #include <iostream> using namespace std; int* initdkntor(int n, int * brokens, int m) { int * p = (int *)malloc(sizeof(int) * n); memset(p, 0, sizeof(int) * n); for (int i = 0; i < m; i++) { for (int j = brokens[i * 2] - 1; j < brokens[i * 2 + 1]; j++) p[j] = 1; } return p; } int* tryit(int *seed, int n, int a, int b) { int * p = (int *)malloc(sizeof(int) * n); memcpy(p, seed, sizeof(int) * n); for (int i = a - 1; i < b; i++) p[i] = 0; return p; } int check(int *p, int n) { for (int i = 0; i < n; i++) if (p[i]) return 1; return 0; } int solve(int *seed, int seedcost, int n, int *sp, int spn) { if (!check(seed, n)) return seedcost; if (!spn) return -1; int min = -1; for (int i = 0; i < spn; i++) { int * seed1 = tryit(seed, n, sp[i*3], sp[i*3+1]); int cost = solve(seed1, seedcost + sp[i*3+2], n, sp + 3 * (i+1), spn - i-1); if (cost != -1) if (cost < min || min == -1) min = cost; } return min; } int main() { int s; int n; int m; cin >> n >> m >> s; int * bk = new int[n * 2]; for (int i = 0; i < n; i++) cin >> bk[i*2] >> bk[i*2+1]; int * sp = new int[m * 3]; for (int i = 0; i < m; i++) cin >> sp[i*3] >> sp[i*3+1] >> sp[i*3+2]; int * dkntor = initdkntor(s, bk, n); int result = solve(dkntor, 0, s, sp, m); cout << result << endl; return 0; }
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报
悬赏问题
- ¥30 这是哪个作者做的宝宝起名网站
- ¥60 版本过低apk如何修改可以兼容新的安卓系统
- ¥25 由IPR导致的DRIVER_POWER_STATE_FAILURE蓝屏
- ¥50 有数据,怎么建立模型求影响全要素生产率的因素
- ¥50 有数据,怎么用matlab求全要素生产率
- ¥15 TI的insta-spin例程
- ¥15 完成下列问题完成下列问题
- ¥15 C#算法问题, 不知道怎么处理这个数据的转换
- ¥15 YoloV5 第三方库的版本对照问题
- ¥15 请完成下列相关问题!