808D - Array Division(思维)

https://codeforces.com/problemset/problem/808/D

---

思路：

这题怎么会在1900的定位=,=

答案肯定是偶数，拿一个变量统计前缀和，如果不够一半就map找后面的有无这个差值，超过了一半就看前面的有无这个多余。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
map<LL,LL>map1,map2;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   LL sum=0;
   for(LL i=1;i<=n;i++){
       cin>>a[i];sum+=a[i];
       map2[a[i]]++;
   }
   if(sum&1){
     cout<<"NO"<<"\n";
   }
   else{
     LL res=0;
     bool flag=0;
     sum/=2;
     for(LL i=1;i<=n;i++){
         map2[a[i]]--;
         res+=a[i];
         if(res==sum){
            flag=1;break;
         }
         else if(sum>res){
            if(map2[sum-res]){
                flag=1;break;
            }
         }
         else if(sum<res){
            if(map1[res-sum]){
                flag=1;break;
            }
         }
         map1[a[i]]++;
     }
     if(flag) cout<<"YES"<<"\n";
     else cout<<"NO"<<"\n";
   }
   return 0;
}