Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
222909 | 232218施彦恺 | *小美的加法 | C++ | Wrong Answer | 80 | 28 MS | 648 KB | 502 | 2023-12-17 14:11:21 |
#include<bits/stdc++.h> using namespace std; int a[100006]; int main(){ int n; cin>>n; int d=0; for(int i=1;i<=n;i++){ cin>>a[i]; d+=a[i]; } int sum=0; int max=-8; int p; for(int i=1;i<=n;i++){ if((a[i]*a[i+1])>max){ max=a[i]*a[i+1]; p=i; } } for(int i=1;i<=n;i++){ if(i==p){ sum+=a[i]*a[i+1]; } else if(i==p+1){ } else{ sum+=a[i]; } } if(d<sum){ cout<<sum; return 0; } else if(d>=sum) cout<<d; return 0; }