hdu 1260 dp

1. #include <stdio.h>
2. #include <string>
3. #include <iostream>
4. #include <set>
5. #include <math.h>
6. #include <stdlib.h>
7. #include <algorithm>
8. using namespace std;
13. int num[2010];
14. int two[2010];
15. int dp[2010];
16. int main()
17. {
18. //freopen("read.txt", "r", stdin);
20. int T;
21. cin >> T;
22. while(T--)
23. {
25. memset(num, 0 , sizeof(num));
26. memset(dp, 0 , sizeof(dp));
27. memset(two, false , sizeof(two));
28. int n;
29. scanf("%d", &n);
30. for(int i=1; i<=n; i++)
31. scanf("%d", &num[i]);
34. for(int i=1; i<=n-1; i++)
35. {
36. scanf("%d", &two[i]);
37. }
39. dp[1] = num[1];
40. for(int i=2; i<=n; i++)
41. {
42. dp[i] = min(dp[i-1]+ num[i], dp[i-2] + two[i-1]);
43. }
45. int s=dp[n] %60;
46. int m=dp[n]/60%60;
47. int h =8 + dp[n-1] /3600;
48. char c1, c2;
49. if(h<12 || (h==12 && s==m && s==0) )
50. {
51. c1='a';
52. c2='m';
53. }
54. else
55. {
56. if(h!=12)
57. h%=12;
58. c1='p';
59. c2='m';
60. }
61. printf("%02d:%02d:%02d %c%c\n",h,m,s,c1,c2);
62. }
63. return 0;
64. }

来自为知笔记(Wiz)

附件列表

 

转载于:https://www.cnblogs.com/sober-reflection/p/3a098a97548b2bb6f71b11bcef5da8a5.html