- https://www.acmicpc.net/problem/17298 #include #include #include #include using namespace std;int n, mx, prev;vector v;int ret[1000004];int a[1000004];stack s;int main(void) { cin >> n; memset(ret, -1, sizeof(ret)); for(int i = 0; i > a[i]; while(!s.empty() && a[s.top()]
Algorithm/Problem Solving
#include #include #include #include using namespace std;int m;string s;vector v;void erase_zero(string& s) { while(true) { if(s.size() != 0 && s.front() == '0') s.erase(s.begin()); else break; } if(s.empty()) s = "0";}bool cmp(string a, string b) { if(a.size() == b.size()) { return a > m; for(int i = 0; i > s; for(char c : s) { if(int('0')
#include#includeusing namespace std;const int mn = 64;int a[mn][mn], v[mn][mn];int n, input;string quad(int y, int x, int size) { if(size == 1) return to_string(a[y][x]); int c = a[y][x]; string ret = ""; for(int i = y; i https://www.acmicpc.net/problem/1992
Sliding Window#include#include#include#includeusing namespace std;int N, K;int input;vector nums;int main(void) { cin >> N >> K; for(int i = 0; i > input; nums.push_back(input); } int start = 0; int end = K; int max_num = accumulate(nums.begin(), nums.begin() + K, 0); int current_sum = accumulate(nums.begin(), nums.begin() + K, 0); while(end Prefix Sum#include #include using names..
