Submission #3438892
Source Code Expand
#include <stdio.h> #include <algorithm> #include <complex> #include<vector> int main() { int n, table[128]{}, max = 0; char s[128]; scanf("%d%s", &n, s); for (char c = 'a'; c <= 'z'; ++c) { int left, right; for (left = 0; left < n; ++left) { if (s[left] == c) break; } for (right = n - 1; right >= 0; --right) { if (s[right] == c) break; } for (int i = left; i < right; ++i) { table[i]++; } } for (int i = 0; i < n; ++i) if (table[i] > max) max = table[i]; printf("%d\n", max); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Cut and Count |
User | TanakaTaroh |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 701 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%s", &n, s); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
subtask_1_01.txt | AC | 1 ms | 128 KB |
subtask_1_02.txt | AC | 1 ms | 128 KB |
subtask_1_03.txt | AC | 1 ms | 128 KB |
subtask_1_04.txt | AC | 1 ms | 128 KB |
subtask_1_05.txt | AC | 1 ms | 128 KB |
subtask_1_06.txt | AC | 1 ms | 128 KB |
subtask_1_07.txt | AC | 1 ms | 128 KB |
subtask_1_08.txt | AC | 1 ms | 128 KB |
subtask_1_09.txt | AC | 1 ms | 128 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 1 ms | 128 KB |
subtask_1_12.txt | AC | 1 ms | 128 KB |
subtask_1_13.txt | AC | 1 ms | 128 KB |
subtask_1_14.txt | AC | 1 ms | 128 KB |
subtask_1_15.txt | AC | 1 ms | 128 KB |
subtask_1_16.txt | AC | 1 ms | 128 KB |
subtask_1_17.txt | AC | 1 ms | 128 KB |
subtask_1_18.txt | AC | 1 ms | 128 KB |
subtask_1_19.txt | AC | 1 ms | 128 KB |