#include<bits/stdc++.h>#define int long longusingnamespace std;signedmain(){int t =1;
cin>>t;while(t--){int n;
cin>>n;
string s;
cin>>s;int res =0;int cnt =0;for(int i =0; i < n ; i ++){if(s[i]=='(') cnt ++;else cnt --;if(cnt <0){
res =max(res,-cnt);}}if(cnt >0){
res =max(res,cnt);}
cout<<res<<endl;}}
#include<bits/stdc++.h>#include<map>#include<algorithm>#define int long longconstint N =4e5+10;constint mod =1e9+7;usingnamespace std;int a[N];signedmain(){int t =1;
cin>>t;while(t--){int n,k;
cin>>n>>k;
map<int,int> mp;for(int i =0; i < n ; i ++){
cin>>a[i];
a[i]=(k-(a[i]%k))%k;if(a[i]){
mp[a[i]]++;}}sort(a,a+n);int maxx =0;int now =0;for(int i =0; i < n ; i ++){if(a[i]){if(mp[a[i]]>= maxx){
maxx = mp[a[i]];
now = a[i];}}}if(maxx ==0)
cout<<0<<endl;else{//cout<<maxx<<" "<<now<<endl;
cout<<maxx*k-(k-now-1)<<endl;}}}
#include<iostream>#include<bits/stdc++.h>#define int long long#define mk make_pair#define gcd __gcd#define pb push_backusingnamespace std;constdouble eps =1e-10;constint mod =1e9+7;constint N =1e6+7;int n,m,k,t =1,cas =1;int a[N],b[N],c[N];int cnt1=0,cnt2=0,cnt3=0;signedmain(){
cin>>n>>k;for(int i =0; i < n ; i ++){int x,y,z;
cin>>x>>y>>z;if(y && z){
c[cnt3++]= x;}elseif(y){
b[cnt2++]= x;}elseif(z){
a[cnt1++]= x;}}sort(a,a+cnt1);sort(b,b+cnt2);sort(c,c+cnt3);int p1 =0,p2 =0, p3 =0;int res =0;int flag =1;for(int i =0; i < k ; i ++){if(p3 < cnt3){if((p1 >= cnt1 || p2 >= cnt2)|| c[p3]< a[p1]+b[p2]){
res += c[p3++];}elseif(p1 < cnt1 && p2 < cnt2){
res += a[p1++];
res += b[p2++];}else{
flag =0;break;}}elseif(p1 < cnt1 && p2 < cnt2){
res += a[p1++];
res += b[p2++];}else{
flag =0;break;}//cout<<p1<<" "<<p2<<" "<<p3<<endl;}if(flag) cout<<res<<endl;else cout<<-1<<endl;}/**
**/
A. Required Remainder题意:给x,y,n,要找一个0-n之内的最大的数使得 k%x == y。思路:n/x*x 就是 最接近n的,且被x整除的数。 加上y就行了。如果超过n了,还要减去一个x。AC代码:#include <bits/stdc++.h>using namespace std; signed main(){ int t = 1; cin>>t; while(t--){ int x,y,n;