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