fork download
copy 
  1. //#include <ext/pb_ds/assoc_container.hpp> 
  2. //#include <ext/pb_ds/tree_policy.hpp> 
  3. //using namespace __gnu_pbds; 
  4. //#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
  5. #include <bits/stdc++.h>
  6. using namespace std;
  7. #define int long long
  8. #define dd double
  9. #define ld long double
  10. #define ull unsigned long long
  11. #define yes cout << "YES\n"
  12. #define no cout << "NO\n"
  13. #define el "\n"
  14. #define Arwa ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  15. #define fix(x) cout << fixed << setprecision(x)
  16. #define all(v) v.begin(),v.end()
  17. void file() 
  18. {
  19.     #ifndef ONLINE_JUDGE
  20.         freopen("input.txt", "r", stdin);
  21.         freopen("output.txt", "w", stdout);
  22.     #endif
  23. }
  24. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  25. int lcm(int a, int b) { return a / gcd(a, b) * b; }
  26. bool prime(int n) {
  27.     if (n == 2) return true;
  28.     if (n % 2 == 0 || n == 1) return false;
  29.     for (int i = 3; i * i <= n; i += 2)
  30.         if (n % i == 0) return false;
  31.     return true;
  32. }
  33. //Here We Go Again
  34. int32_t main() 
  35. {
  36.     Arwa
  37.     //file();
  38.     int t=1;
  39.     //cin>>t;
  40.     while(t--) 
  41.     {
  42.      string s;
  43.      stack<int>st;
  44.      map<int,int>m;
  45.      vector<int>v,vv;
  46.      cin>>s;
  47.      for(int i=0;i<s.length();i++)
  48.      {
  49.         if(s[i]=='('||s[i]=='{'||s[i]=='['||s[i]=='<')
  50.         st.push(i);
  51.         else if(!st.empty())
  52.         {
  53.             if(s[i]==')'&&s[st.top()]=='(')
  54.             st.pop();
  55.             else if(s[i]=='}'&&s[st.top()]=='{')
  56.             st.pop();
  57.             else if(s[i]==']'&&s[st.top()]=='[')
  58.             st.pop();
  59.             else if(s[i]=='>'&&s[st.top()]=='<')
  60.             st.pop();
  61.             else v.push_back(i);
  62.         }
  63.         else v.push_back(i);
  64.     }
  65.     if(!st.empty())
  66.     {
  67.     while(!st.empty())
  68.     {
  69.     v.push_back(st.top());
  70.     st.pop();
  71.     }
  72.     }
  73.     v.push_back(s.length());
  74.     v.push_back(-1);
  75.     sort(all(v));
  76.     for(int i=v.size()-1;i>0;i--)
  77.     {
  78.     if(v[i]-v[i-1]-1!=0)
  79.     vv.push_back(v[i]-v[i-1]-1);
  80.     } 
  81.     for(auto it:vv)
  82.     {
  83.     //cout<<it<<' ';
  84.     m[it]++;
  85.     }
  86.     int max=0,mx=0;
  87.     for(int i=0;i<vv.size();i++)
  88.     {
  89.         if(vv[i]>max)
  90.         {
  91.             mx=m[vv[i]];
  92.             max=vv[i];
  93.         }
  94.     }
  95.     if(max==0)
  96.     cout<<0<<' '<<1<<el;
  97.     else cout<<max<<' '<<mx<<el;
  98.  
  99.     }
  100.     return 0;
  101. }
  102.  
Success #stdin #stdout 0.01s 5216KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0 1
https://ideone.com/h6KdVz
language:
C++ (gcc 8.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!