weixin_60789461的博客

#include <iostream>#include <unordered_map>#include <string.h>#include "cmath"#define int long longusing namespace std;unordered_map<char,int>cantor;//构建一个对应的字符串与数值的表//转换模块int trans(string n,int radix){ int ans = 0; for(.

#include <iostream>#include <string.h>using namespace std;struct node{ int pos=0;; double val;}a[1100],b[1100];//int tot=0;double ans[5000];int main() { int k1,k2;cin>>k1;// int tot; memset(ans, 0, sizeof(ans)); for(int i=1.

一个尝试一个存，注意特殊的情况，比如全为负数#include <cstring>#include <cstdio>#include <iostream>#include <algorithm>#include <unordered_map>#define dd double#define PII pair<int,int>#define int long long#define ll long longusing

注意为0的特殊情况AC代码：#include <cstring>#include <cstdio>#include <iostream>#include <algorithm>#include <unordered_map>#define dd double#define PII pair<int,int>#define int long long#define ll long longusing names

#include <stdio.h>#include <cstring>#include <vector>#include <queue>#include <iostream>#include <algorithm>#include <string.h>#include <string>#define int long longusing namespace std;const int N .

#include <stdio.h>#include <cstring>#include <vector>#include <queue>#include <iostream>#include <algorithm>#include <string.h>#include <string>#define int long longusing namespace std;const int N .

这道题很简单，找最前，找最后，思路很清晰：代码：#include <cstdio>#include <cstring>#include <vector>#include <queue>#include <iostream>#include <algorithm>#define int long longusing namespace std;const int N = 1010;struct node{ c