Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
222911 | 陆沛埦 | *小美的加法 | C++ | Wrong Answer | 70 | 16 MS | 1828 KB | 512 | 2023-12-17 14:12:37 |
#include <bits/stdc++.h> using namespace std; long long n; long long a[100002],len; long long f[100002]; long long v[100002]; long long sum; long long x1,x2; int main() { scanf("%lld",&n); int maxx=0; for(long long i=1; i<=n; i++) { scanf("%lld",&a[i]); f[i]=a[i]*a[i-1]; } for(int i=1; i<=n; i++) { if(sum<f[i]) { sum=f[i]; x1=i; x2=i-1; } } for(int i=1; i<=n; i++) { if(i!=x1&&i!=x2) { sum+=a[i]; } } printf("%lld\n",sum); return 0; }