Submission #30096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
30096	2017-07-22T05:56:05 Z	구사과(#1250)	Difference (POI11_roz)	C++	10 / 100	266 ms	2996 KB

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int MAXN = 1000005;

int n;
char str[MAXN];

int main(){
	cin >> n >> (str + 1);
	int ans = 0;
	for(int i='a'; i<='z'; i++){
		int cnt[26] = {};
		for(int j=1; j<=n; j++){
			if(str[j] == i){
				for(int j=0; j<26; j++) cnt[j] = max(cnt[j], 0);
				int aux[26] = {};
				for(int k=j+1; k<=n && str[k] != i; k++){
					aux[str[k] - 'a']++;
				}
				cnt[str[j] - 'a']++;
				for(int j=0; j<26; j++) cnt[j]--;
				for(int j=0; j<26; j++){
					ans = max(ans, cnt[j] + aux[j]);
				}
			}
			else{
				cnt[str[j] - 'a']++;
			}
		}
	}
	cout << ans;
}

Compilation message

roz.cpp: In function 'int main()':
roz.cpp:20:15: warning: name lookup of 'j' changed
     for(int k=j+1; k<=n && str[k] != i; k++){
               ^
roz.cpp:16:11: warning:   matches this 'j' under ISO standard rules
   for(int j=1; j<=n; j++){
           ^
roz.cpp:18:13: warning:   matches this 'j' under old rules
     for(int j=0; j<26; j++) cnt[j] = max(cnt[j], 0);
             ^

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	2996 KB	Output is correct
2	Correct	2996 KB	Output is correct
3	Correct	2996 KB	Output is correct

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	26 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	236 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	233 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	266 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	219 ms	2996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-