Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
222965 | 顾欣薇 | *小美的加法 | C++ | Wrong Answer | 80 | 36 MS | 660 KB | 628 | 2023-12-17 14:36:13 |
#include <bits/stdc++.h> using namespace std; int main() { int n,a[100004],max=0,sum=0,ans[3],d=0; bool t=0; cin >> n; for (int i=1;i<=n;i++) { cin >> a[i]; if (i!=1&&a[i]*a[i-1]>max) { max=a[i]*a[i-1]; //cout << max << " "; } } //cout << endl; //cout << max << endl; for (int i=1;i<=n;i++) { if (a[i]*a[i+1]==max&&t==0) { sum+=a[i]*a[i+1]; t=1; i++; }else { sum+=a[i]; } //cout << sum << " "; } ans[1]=sum; sum=0; for (int i=1;i<=n;i++) { sum+=a[i]; } ans[2]=sum; if (ans[1]>ans[2]) { d=ans[1]; }else { d=ans[2]; } cout << d; }