Artifact 2cfe42a5f5982f8400cfe2885fddbe36521740cc
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class Arrows { public:
int longestArrow(string s)
{
string rs = s;
reverse(rs.begin(), rs.end());
return max(max(la(s,'<','-'), la(s,'<','=')), max(la(rs,'>','-'), la(rs,'>','=')));
}
int la(string s, char h, char t)
{
int m = -1;
for(int i=0; i<s.size(); ++i)
if( s[i]==h ) {
int j=i+1;
while( j<s.size() && s[j]==t )
++j;
m = max(m, j-i);
}
return m;
}
};
// BEGIN CUT HERE
#include <ctime>
double start_time; string timer()
{ ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
{ os << "{ ";
for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
void verify_case(const int& Expected, const int& Received) {
bool ok = (Expected == Received);
if(ok) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl;
cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
#define END verify_case(_, Arrows().longestArrow(s));}
int main(){
CASE(0)
string s = "<--->--==>";
int _ = 4;
END
CASE(1)
string s = "<<<<<<<<<<";
int _ = 1;
END
CASE(2)
string s = "----==-";
int _ = -1;
END
CASE(3)
string s = "<----=====>";
int _ = 6;
END
}
// END CUT HERE