#include <iostream>
using std::cout;
using std::cin;
using std::ios;
using std::cerr;
using std::endl;
#include <stdio.h>
#include <fstream>
using namespace std;
using std::ifstream;
using std::ofstream;
#include <cstdlib>
#include <math.h>
#include <algorithm> // std::fill
#include <vector> // std::vector
class Solution {
public:
int lengthOfLongestSubstring(string s) {
const int ASCII_MAX = 255;
int last[ASCII_MAX];
int start = 0;
fill(last, last + ASCII_MAX, -1);
int max_len = 0;
for (int i = 0; i < s.size(); i++) {
if (last[s[i]] >= start) {
max_len = max(i - start, max_len);
start = last[s[i]] + 1;
}
last[s[i]] = i;
}
return max((int)s.size() - start, max_len);
}
};
//##############################################################################
int main() { // M A I N P R O G R A M
//##############################################################################
int i, j, q, l;
int counter;
double temptemp;
int numnum = 0;
Solution s;
system("pause");
return 0;
} // int main()