网易笔试题,求大佬回复,哪不对
#include <bits/stdc++.h>
using namespace std;
int main()
{
int T,n;
cin>>T;
while(cin>>n){
vector<int> a(n), b(n-1);
int x;
for(int i=0;i<n;i++){
cin >> x;
a.push_back(x);
}
for(int i=0;i<n-1;i++){
cin >> x;
b.push_back(x);
}
vector<int> dp(n+1, 10000);
dp[0]=0;
dp[1]=a[0];
for(int i=2;i<=n;i++){
dp[i]=min(dp[i-1]+a[i-1],dp[i-2]+b[i-2]);
}
int sec = dp[n]%60;
int mil = dp[n]/60;
if(mil>=60)
{
int h = mil/60;
mil = mil%60;
}
h = h+8;
if(h<12)
cout << setpresicion(2) << h << ":" << mil << ":" << sec << " " << "am" << endl;
else
cout << setpresicion(2) << h << ":" << mil << ":" << sec << " " << "pm"<< endl;
}
return 0;
#include <bits/stdc++.h>
using namespace std;
int main()
{
int T,n;
cin>>T;
while(cin>>n){
vector<int> a(n), b(n-1);
int x;
for(int i=0;i<n;i++){
cin >> x;
a.push_back(x);
}
for(int i=0;i<n-1;i++){
cin >> x;
b.push_back(x);
}
vector<int> dp(n+1, 10000);
dp[0]=0;
dp[1]=a[0];
for(int i=2;i<=n;i++){
dp[i]=min(dp[i-1]+a[i-1],dp[i-2]+b[i-2]);
}
int sec = dp[n]%60;
int mil = dp[n]/60;
if(mil>=60)
{
int h = mil/60;
mil = mil%60;
}
h = h+8;
if(h<12)
cout << setpresicion(2) << h << ":" << mil << ":" << sec << " " << "am" << endl;
else
cout << setpresicion(2) << h << ":" << mil << ":" << sec << " " << "pm"<< endl;
}
return 0;
全部评论
相关推荐
点赞 评论 收藏
分享

点赞 评论 收藏
分享
点赞 评论 收藏
分享