[2016-03-27][HDU][1260][Tickets]

  • 时间:2016-03-27 22:37:37 星期日

  • 题目编号:[2016-03-27][HDU][1260][Tickets]

  • 遇到的问题:分钟数字,除以60以后还要模60 t / 60 % 60

  1. #include <cstdio>
  2. #include <algorithm>
  3. using namespace std;
  4. typedef long long LL;
  5. const int maxk = 2000 + 10;
  6. int s[maxk],d[maxk];
  7. int dp[maxk];
  8. int main(){
  9. int t;
  10. scanf("%d",&t);
  11. while(t--){
  12. int k;
  13. scanf("%d",&k);
  14. for(int i = 1;i <= k ;++i)
  15. scanf("%d",&s[i]);
  16. for(int i = 1;i < k ;++i)
  17. scanf("%d",&d[i]);
  18. dp[0] = 0;dp[1] = s[1];
  19. for(int i = 2; i <= k ;++i)
  20. dp[i] = min(dp[i - 1] + s[i],dp[i - 2] + d[i - 1]);
  21. int hour = dp[k] / 3600 + 8,minute = dp[k]/60 % 60,second = dp[k] % 60;
  22. printf("%02d:%02d:%02d %s\n",hour%12,minute,second,hour / 12 ?"pm":"am");
  23. }
  24. return 0;
  25. }

来自为知笔记(Wiz)

时间: 2024-10-09 20:16:39

[2016-03-27][HDU][1260][Tickets]的相关文章

【万能的搜索,用广搜来解决DP问题】ZZNU -2046 : 生化危机 / HDU 1260:Tickets

2046 : 生化危机 时间限制:1 Sec内存限制:128 MiB提交:19答案正确:8 题目描述 当致命的T病毒从Umbrella Corporation 逃出的时候,地球上大部分的人都死去了. 麻烦的是,他们并没有真正的死去. 爱丽诗在一个狭窄的巷子中,遇见了n个丧尸(编号1-n),巷子太窄了,爱丽诗只能按顺序解决它们. 爱丽诗擅长用匕首和弓箭,当爱丽诗面临编号为i的丧尸时,匕首每次只能解决一个丧尸用时为a[i],弓箭每次能且只能解决两个相邻的丧尸(丧尸i,和丧尸i+1),用时为b[i].

[ACM] hdu 1260 Tickets (动态规划)

Tickets Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 4   Accepted Submission(s) : 2 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Jesus, what a great movie! Thou

HDU 1260 Tickets (动规)

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 924    Accepted Submission(s): 468 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However,

DP [HDU 1260] Tickets

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1191    Accepted Submission(s): 559 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However

[dp专题]hdu 1260 tickets

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1408    Accepted Submission(s): 687 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However,

hdu 1260 Tickets 【dp】

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1258    Accepted Submission(s): 599 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However

HDU 1260 TICKETS (简单DP)

ickets TimeLimit: 2000/1000 MS (Java/Others)  MemoryLimit: 65536/32768 K (Java/Others) 64-bit integer IO format:%I64d Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time fo

HDU 1260 Tickets (动态规划)

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12331    Accepted Submission(s): 6096 Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. Howeve

HDU 1260 Tickets

dp[i]表示到i这个人所用的最少时间 状态转移方程 dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i-1]); 最后转换一下时间就可以了,当小时大于等于12的时候显示pm,其余显示am #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; const int maxn=2000+10; int T,n; in