这道题一开始以为是dp,但似乎大家都是用贪心解决。事实上只要贪得正确,100分是没有问题的。
先用θ(n)找出最大值,然后,先根据推销疲劳值再根据距离进行排序,依次累加求和即可。
该算法的时间复杂度为θ(n+nlog2n)。
# include <algorithm>
# include <cstdio>
const int SIZE = 100005;
struct Tnode {
int S , A , sum ;
void clear () {
S = A = sum = -1 ;
}
} a[SIZE];
int N , max_id , ans , distance ;
bool cmp ( Tnode , Tnode ) ;
int main () {
freopen ( "salesman.in" , "r" , stdin ) ;
freopen ( "salesman.out" , "w" , stdout ) ;
scanf ( "%d" , &N ) ;
for ( int i=0 ; i!=N ; ++i ) {
scanf ( "%d" , &a[i].S ) ;
a[i].S <<= 1 ;
}
max_id = N ;
a[N].clear () ;
for ( int i=0 ; i!=N ; ++i ) {
scanf ( "%d" , &a[i].A ) ;
a[i].sum = a[i].S + a[i].A ;
if ( ( a[i].sum > a[max_id].sum ) || ( ( a[i].sum == a[max_id].sum ) && ( a[i].S > a[max_id].S ) ) ) {
max_id = i ;
}
}
ans = a[max_id].sum ;
distance = a[max_id].S ;
printf ( "%d\n" , ans ) ;
a[max_id].clear () ;
std::sort ( a , a + N , cmp ) ;
for ( int i=0 ; i!=N-1 ; ++i ) {
ans += a[i].A ;
if ( a[i].S > distance ) {
ans += ( a[i].S - distance ) ;
distance = a[i].S ;
}
printf ( "%d\n" , ans ) ;
}
return 0 ;
}
bool cmp ( Tnode i , Tnode j ) {
return ( ( i.A > j.A ) || ( ( i.A == j.A ) && ( i.S > j.S ) ) ) ;
}