618F Double Knapsack

传送门

题目大意

分析

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
#define int long long
int vis[],a[],b[],p1[],p2[];
signed main(){
    int n,m,i,j,k=,l1,l2,r1,r2;
    scanf("%lld",&n);
    for(i=;i<=n;i++)scanf("%lld",&a[i]),a[i]+=a[i-];
    for(i=;i<=n;i++)scanf("%lld",&b[i]),b[i]+=b[i-];
    if(a[n]>b[n]){
      k=;
      for(i=;i<=n;i++)swap(a[i],b[i]);
    }
    int L=;
    for(i=;i<=n;i++){
      while(L<n&&b[L+]<=a[i])L++;
      int sum=a[i]-b[L];
      if(vis[sum]){
          l1=p1[sum]+,l2=p2[sum]+;
          r1=i,r2=L;
          break;
      }else {
          vis[sum]=;
          p1[sum]=i,p2[sum]=L;
      }
    }
    if(k)swap(l1,l2),swap(r1,r2);
    printf("%lld\n",r1-l1+);
    for(i=l1;i<=r1;i++)printf("%lld ",i);
    puts("");
    printf("%lld\n",r2-l2+);
    for(i=l2;i<=r2;i++)printf("%lld ",i);
    return ;
}