div2的A啊……sb模拟
六种情况搞来搞去
1 #include<cstdio> 2 #include<iostream> 3 #include<cstring> 4 #include<cstdlib> 5 #include<algorithm> 6 #include<cmath> 7 #include<queue> 8 #include<deque> 9 #include<set> 10 #include<map> 11 #include<ctime> 12 #define LL long long 13 #define inf 0x7ffffff 14 #define pa pair<int,int> 15 #define pi 3.1415926535897932384626433832795028841971 16 using namespace std; 17 LL a,b,c,ans; 18 inline LL read() 19 { 20 LL x=0,f=1;char ch=getchar(); 21 while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} 22 while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} 23 return x*f; 24 } 25 int main() 26 { 27 a=read();b=read();c=read(); 28 ans=a+b+c; 29 ans=max(ans,a+b*c); 30 ans=max(ans,a*b+c); 31 ans=max(ans,(a+b)*c); 32 ans=max(ans,a*(b+c)); 33 ans=max(ans,a*b*c); 34 printf("%lld\n",ans); 35 }
——by zhber,转载请注明来源