解题思路:
注意事项:
参考代码:
宏伟的程序,我自己看的都头疼:
#include <iostream> #define maxn 50 using namespace std; int n,m; int ans = 0; int worklist[maxn * maxn]; int worknumber[maxn][maxn]; int worktime[maxn][maxn]; int cnt_now_work_step[maxn]; int lasttime[maxn]; bool timeline[maxn * maxn][maxn * maxn]; bool check_in_line(int begin_time_point,int end_time_length,int workid){ for (int time = begin_time_point; time <= end_time_length;time++) if (timeline[workid][time]) return false; return true; } int main(){ cin >> m >> n; for (int i=1;i<=n*m;i++) cin >> worklist[i]; for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) cin >> worknumber[i][j]; for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) cin >> worktime[i][j]; for (int i=1;i<=n*m;i++){ int nowitem = worklist[i]; cnt_now_work_step[nowitem]++;//工序数 int nownumber = worknumber[nowitem][cnt_now_work_step[nowitem]]; int costtime = worktime[nowitem][cnt_now_work_step[nowitem]]; for (int time = lasttime[nowitem]+1;;time++)//扫描时间轴 if (check_in_line(time,time+costtime-1,nownumber)){ for (int marktime = time;marktime <= time+costtime-1;marktime++) timeline[nownumber][marktime] = true; lasttime[nowitem] = time + costtime - 1; break; } } for (int i=1;i<=n;i++) ans = max(ans,lasttime[i]); cout << ans << endl; return 0; }
0.0分
26 人评分
数组与指针的问题浏览:716 |
C二级辅导-温度转换 (C语言代码)浏览:718 |
C二级辅导-统计字符 (C语言代码)浏览:476 |
用筛法求之N内的素数。 (C语言代码)浏览:529 |
C语言程序设计教程(第三版)课后习题6.5 (C语言代码)浏览:523 |
C语言程序设计教程(第三版)课后习题1.5 (C++代码)浏览:403 |
求教大神。。。。1063,统计字符。浏览:11684 |
C语言程序设计教程(第三版)课后习题6.7 (C++代码)浏览:586 |
C语言程序设计教程(第三版)课后习题9.4 (C语言代码)浏览:3357 |
Manchester-数字整除最原始易理解方法浏览:4478 |