O(n)42分
查看原帖
O(n)42分
895614
bohemiao楼主2023/10/13 16:40
#include<bits/stdc++.h>
using namespace std;
long long n,a1,a2,a3,b1,b2,b3,m1,m2,m3,i1,i2,i3,k;
int main(){
	cin>>n;
	k=n;
	cin>>a1>>b1>>a2>>b2>>a3>>b3;
	while(k) k-=a1,i1++;
	k=n;
	while(k) k-=a2,i2++;
	k=n;
	while(k) k-=a3,i3++;
	m1=b1*i1;
	m2=b2*i2;
	m3=b3*i3;
	cout<<min(m1,min(m2,m3));
	return 0;
}

tack0

#4,5,6,7,13,14,15,20,21 AC #8,9,10,11,16,17,18,19,22,23 TLE

tack1

#1,2,3 TLE

O(n)为什么会TLE???

2023/10/13 16:40
加载中...