YORU

摘要： http://acm.nyist.net/JudgeOnline/problem.php?pid=267好烦....View Code 1 #include <stdio.h> 2 #include <string.h> 3 #define maxn 1005 4 char stack[maxn],str[maxn],source[maxn],aim[maxn][10]; 5 double num[maxn],s[maxn]; 6 int main() 7 { 8 int i,j,l,k,t,le,rear,f=0,mark,iter; 9 double a... 阅读全文

摘要： http://acm.nyist.net/JudgeOnline/problem.php?pid=257栈的应用....View Code 1 #include <stdio.h> 2 #include <string.h> 3 #define maxn 1005 4 char stack[maxn],str[maxn],source[maxn]; 5 int main() 6 { 7 int i,j,l,k,t,le,rear; 8 scanf("%d",&t); 9 while(t--)10 {11 scanf("%s" 阅读全文

摘要： http://acm.nyist.net/JudgeOnline/problem.php?pid=228本想用树状数组的, 结果有点囧...........然后看了别的大牛的做法.... 离线查询的可以有o(n)的算法...View Code 1 2 #include <iostream> 3 #include <stdio.h> 4 using namespace std; 5 const int maxn = 1000005; 6 const int M = 10003; 7 int ans[maxn]; 8 int main() 9 {10 int n, m, q 阅读全文