A.
加加减减即可。
#include<iostream> #include<cstdio> #include<string> #include<cstring> #include<algorithm> #include<queue> #define ll long long using namespace std; const int maxn = 105000; int main(){ int n; ll x,y,z; cin>>n; for(int i = 1;i <= n;i++){ cin>>x>>y>>z; cout<<max(x-y,x-z)+1<<endl; } return 0; }